Using Generic Programming for Designing a Data Structure for Polyhedral Surfaces (1999)

Cached

Download Links

by Lutz Kettner
Venue:Comput. Geom. Theory Appl
Citations:46 - 5 self

Documents Related by Co-Citation

974 Computational geometry: algorithms and applications – - 2008
91 On the design of CGAL a computational geometry algorithms library – - 1999
635 LEDA: A Platform for Combinatorial and Geometric Computing – - 1999
456 Primitives for the manipulation of general subdivisions and the computation of voronoi diagrams – - 1985
64 Traits: a new and useful template technique – - 1995
82 The radial edge structure: A topological representation for non-manifold geometric boundary modeling – - 1988
266 An Introduction to Solid Modeling – - 1988
276 Geometry images – - 2002
33 Exact and efficient construction of Minkowski sums of convex polyhedra with applications – - 2006
7 Infimaximal Frames -- A Technique For Making Lines Look Like Segments – - 2000
24 An exact, complete and efficient implementation for computing planar maps of quadric intersection curves – - 2005
32 Advanced programming techniques applied to Cgal’s arrangement package – - 2005
17 Boolean operations on 3D selective Nef complexes: Data structure, algorithms, and implementation – - 2003
47 The CGAL Kernel: A Basis for Geometric Computation – - 1996
135 Adaptive Precision Floating-Point Arithmetic and Fast Robust Geometric Predicates – - 1996
138 Fast and Memory Efficient Polygonal Simplification – - 1998
98 Topological Noise Removal
59 BELYAEV A.: Detection of salient curvature features on polygonal surfaces
169 Simplifying Surfaces with Color and Texture using Quadric Error Metrics – - 1998