Triangulation of CAD data for visualization using a compact array-based triangle data structure

The proposed triangulation method was designed for mobile devices with inadequate memory size and CPU speed compared to desktop computers. We considered both efficiency and compactness in our implementation. Topological operators are defined for querying and searching information within indexed triangle data. Experimental results empirically show that the triangulation method is of O(n) time complexity, and is bounded by O(n log n) for worst-case data.