CGAL Arrangements and their applications. A step-by-step guide
DOI10.1007/978-3-642-17283-0zbMATH Open1258.65025OpenAlexW2492066231MaRDI QIDQ625322FDOQ625322
Authors: Efi Fogel, Dan Halperin, Ron Wein 
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
Recommendations
- scientific article; zbMATH DE number 1424290
- An introduction to hyperplane arrangements
- Hyperplane arrangements. An introduction
- An introduction to arrangements of hyperplanes
- Constructing Arrangements of Lines and Hyperplanes with Applications
- Arrangements in Geometry: Recent Advances and Challenges
- Introduction to configuration spaces and their applications
- scientific article; zbMATH DE number 2109336
- Visualizing and exploring planar algebraic arrangements
- scientific article; zbMATH DE number 4200233
monographgeometric arrangementsgeneric programmingComputational Geometry Algorithm Libraryexact geometric computationwell-behaved curves
Packaged methods for numerical algorithms (65Y15) 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)
Cited In (15)
- Rods and Rings: Soft Subdivision Planner for R^3 x S^2.
- Soft subdivision motion planning for complex planar robots
- Throwing a sofa through the window
- Kinetic Voronoi diagrams and Delaunay triangulations under polygonal distance functions
- Algorithms – ESA 2004
- Area optimal polygonization using simulated annealing
- The distance between convex sets with Minkowski sum structure: application to collision detection
- CGAL
- On the complexity of computing with planar algebraic curves
- Arrangements on parametric surfaces. II: Concretizations and applications
- Optimal algorithms for separating a polyhedron from its single-part mold
- Optimal randomized incremental construction for guaranteed logarithmic planar point location
- CGAL -- reliable geometric computing for academia and industry
- Soft Subdivision Motion Planning for Complex Planar Robots
- Advanced programming techniques applied to CGAL's arrangement package
Uses Software
This page was built for publication: CGAL Arrangements and their applications. A step-by-step guide
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q625322)
