CGAL Arrangements and their applications. A step-by-step guide

DOI10.1007/978-3-642-17283-0zbMath1258.65025OpenAlexW2492066231MaRDI QIDQ625322

Efi Fogel, Ron Wein, Dan Halperin

Publication date: 16 February 2011

Published in: Geometry and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-17283-0

zbMATH Keywords

monographgeometric arrangementsgeneric programmingexact geometric computationComputational Geometry Algorithm Librarywell-behaved curves

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to convex and discrete geometry (52-04) Computational aspects related to convexity (52B55) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Packaged methods for numerical algorithms (65Y15)

Related Items

Exact Minkowski sums of polygons with holes, Soft subdivision motion planning for complex planar robots, Optimal randomized incremental construction for guaranteed logarithmic planar point location, Area Optimal Polygonization Using Simulated Annealing, Throwing a sofa through the window, Kinetic Voronoi diagrams and Delaunay triangulations under polygonal distance functions, Soft Subdivision Motion Planning for Complex Planar Robots, On the complexity of computing with planar algebraic curves, Motion planning via manifold samples, The distance between convex sets with Minkowski sum structure: application to collision detection, CGAL, Rods and Rings: Soft Subdivision Planner for R^3 x S^2.

Uses Software

• 2D Arrangement
• 3D envelopes
• 2D Minkowski sums
• 2D Regularized Boolean Set-Operations
• 3D spherical kernel