Controlled perturbation of sets of line segments in R^2 with smart processing order
From MaRDI portal
Publication:543787
DOI10.1016/J.COMGEO.2010.12.002zbMATH Open1233.65022OpenAlexW2072599172MaRDI QIDQ543787FDOQ543787
Authors: Eli Packer 
Publication date: 17 June 2011
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.comgeo.2010.12.002
Recommendations
- Controlled Perturbation for Certified Geometric Computing with Fixed-Precision Arithmetic
- A general approach to the analysis of controlled perturbation algorithms
- CONTROLLED PERTURBATION FOR ARRANGEMENTS OF CIRCLES
- Controlled perturbation for Delaunay triangulations
- Reliable and Efficient Computational Geometry Via Controlled Perturbation
degeneracyline segmentssorting algorithmround-off errorcontrolled perturbationdefinite-degeneracyfixed-precision numbergeometric predicatepotential degeneracy
Cites Work
- Title not available (Why is that?)
- Aggregating inconsistent information: ranking and clustering
- Classroom examples of robustness problems in geometric computations
- Polyhedral perturbations that preserve topological form
- The computational geometry algorithms library CGAL
- CONTROLLED PERTURBATION FOR ARRANGEMENTS OF CIRCLES
- Reliable and Efficient Computational Geometry Via Controlled Perturbation
- A perturbation scheme for spherical arrangements with application to molecular modeling
- Controlled perturbation for Delaunay triangulations
- Approximation algorithms for spreading points
- Combinatorial algorithms for feedback problems in directed graphs
- Ordering by weighted number of wins gives a good ranking for weighted tournaments
Cited In (3)
This page was built for publication: Controlled perturbation of sets of line segments in \(\mathbb R^2\) with smart processing order
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q543787)
