A package for exact kinetic data structures and sweepline algorithms

DOI10.1016/J.COMGEO.2006.11.006zbMATH Open1114.65311DBLPjournals/comgeo/RusselKG07OpenAlexW2167205086WikidataQ33774234 ScholiaQ33774234MaRDI QIDQ2371341FDOQ2371341

Authors: Daniel Russel, Leonidas Guibas, Menelaos I. Karavelas 

Publication date: 4 July 2007

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: http://europepmc.org/articles/pmc3001684

Recommendations

• 3D kinetic alpha complexes and their implementation
• Soft kinetic data structures
• A generic algebraic kernel for non-linear geometric applications
• Robust Kinetic Convex Hulls in 3D
• A kinetic triangulation scheme for moving points in the plane

zbMATH Keywords

Delaunay triangulationskinetic data structurespackagecomputational geomerty algorithms library (CGAL)

Mathematics Subject Classification ID

Packaged methods for numerical algorithms (65Y15) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Cites Work

• Title not available (Why is that?)
• Algorithms – ESA 2005
• Title not available (Why is that?)
• An empirical comparison of techniques for updating Delaunay triangulations
• KINETIC COLLISION DETECTION FOR SIMPLE POLYGONS
• An approximate arrangement algorithm for semi-algebraic curves
• Star splaying

Cited In (2)

• Real algebraic numbers and polynomial systems of small degree
• 3D kinetic alpha complexes and their implementation

Uses Software

• CGAL
• LEDA
• EXACUS
• Kinetic Framework

This page was built for publication: A package for exact kinetic data structures and sweepline algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2371341)