Using generic programming for designing a data structure for polyhedral surfaces
From MaRDI portal
Publication:1305866
DOI10.1016/S0925-7721(99)00007-3zbMath0935.68122MaRDI QIDQ1305866
Publication date: 23 November 1999
Published in: Computational Geometry (Search for Journal in Brave)
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Data structures (68P05)
Related Items
Minimum Cuts in Surface Graphs, CATALOG-BASED REPRESENTATION OF 2D TRIANGULATIONS, EXTENDING THE DOUBLY LINKED FACE LIST FOR THE REPRESENTATION OF 2-PSEUDOMANIFOLDS AND 2-MANIFOLDS WITH BOUNDARIES, An adaptable and extensible geometry kernel, Advanced programming techniques applied to CGAL's arrangement package, Boolean operations on 3D selective Nef complexes: data structure, algorithms, optimized implementation and experiments, General, robust, and efficient polyhedron intersection in the interface reconstruction library, An adaptive virtual element method for the polymeric self-consistent field theory, Arrangements on parametric surfaces. II: Concretizations and applications, Testing graph isotopy on surfaces, THE HAUSDORFF VORONOI DIAGRAM OF POLYGONAL OBJECTS: A DIVIDE AND CONQUER APPROACH, An efficient local approach to convexity testing of piecewise-linear hypersurfaces, Adaptive techniques for unstructured nested meshes, COMPACT REPRESENTATIONS OF SIMPLICIAL MESHES IN TWO AND THREE DIMENSIONS, On the design of CGAL a computational geometry algorithms library, A nonconforming Crouzeix-Raviart type finite element on polygonal meshes, Truly selective polygonal mesh hierarchies with error control, A Hybrid Approach to Fast Indirect Quadrilateral Mesh Generation, Triangulations in CGAL
Uses Software
