Pages that link to "Item:Q1305866"
From MaRDI portal
The following pages link to Using generic programming for designing a data structure for polyhedral surfaces (Q1305866):
Displayed 10 items.
- An efficient local approach to convexity testing of piecewise-linear hypersurfaces (Q955229) (← links)
- Triangulations in CGAL (Q1602941) (← links)
- Adaptive techniques for unstructured nested meshes (Q1765501) (← links)
- An adaptable and extensible geometry kernel (Q2371334) (← links)
- Advanced programming techniques applied to CGAL's arrangement package (Q2371336) (← links)
- Boolean operations on 3D selective Nef complexes: data structure, algorithms, optimized implementation and experiments (Q2371337) (← links)
- Truly selective polygonal mesh hierarchies with error control (Q2573867) (← links)
- COMPACT REPRESENTATIONS OF SIMPLICIAL MESHES IN TWO AND THREE DIMENSIONS (Q4676179) (← links)
- (Q4789074) (← links)
- THE HAUSDORFF VORONOI DIAGRAM OF POLYGONAL OBJECTS: A DIVIDE AND CONQUER APPROACH (Q5711095) (← links)