Arrangements on parametric surfaces. I: General framework and infrastructure
From MaRDI portal
Publication:626974
DOI10.1007/s11786-010-0042-5zbMath1205.68457MaRDI QIDQ626974
Kurt Mehlhorn, Eric Berberich, Dan Halperin, Ron Wein, Efi Fogel
Publication date: 19 February 2011
Published in: Mathematics in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11786-010-0042-5
parametric surface; computational geometry; \texttt{CGAL}; arrangement of curves; robust geometric computing
14Q10: Computational aspects of algebraic surfaces
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
Related Items
Optimal window queries on line segments using the trapezoidal search DAG, Relative convex hulls in semi-dynamic arrangements, Arrangements on parametric surfaces. II: Concretizations and applications, Motion planning via manifold samples
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Arrangements on parametric surfaces. II: Concretizations and applications
- Design of the CGAL 3D spherical kernel and application to arrangements of circles on a sphere
- Computing the arrangement of circles on a sphere, with applications in structural biology
- Voronoi diagrams and arrangements
- A perturbation scheme for spherical arrangements with application to molecular modeling
- Advanced programming techniques applied to CGAL's arrangement package
- Algorithms for Reporting and Counting Geometric Intersections
- Constructing Two-Dimensional Voronoi Diagrams via Divide-and-Conquer of Envelopes in Space
- AN APPROXIMATE ARRANGEMENT ALGORITHM FOR SEMI-ALGEBRAIC CURVES
- Sweeping and Maintaining Two-Dimensional Arrangements on Surfaces: A First Step
- Arrangements of geodesic arcs on the sphere
- EXACT ALGORITHMS FOR CIRCLES ON THE SPHERE
- On the design of CGAL a computational geometry algorithms library
- Infimaximal Frames: A Technique for Making Lines Look Like Segments
- Computing a canonical polygonal schema of an orientable triangulated surface
- An exact, complete and efficient implementation for computing planar maps of quadric intersection curves
- Robust, Generic and Efficient Construction of Envelopes of Surfaces in Three-Dimensional Spaces
