Robust Proximity Queries: An Illustration of Degree-Driven Algorithm Design
From MaRDI portal
Publication:4229412
DOI10.1137/S0097539796305365zbMath0918.68116OpenAlexW1964080182MaRDI QIDQ4229412
Roberto Tamassia, Giuseppe Liotta, Franco P. Preparata
Publication date: 22 February 1999
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0097539796305365
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)
Related Items
Optimal and suboptimal robust algorithms for proximity graphs, Computing the Implicit Voronoi Diagram in Triple Precision, A Low Arithmetic-Degree Algorithm for Computing Proximity Graphs, Smoothing the Gap Between NP and ER, Checking the convexity of polytopes and the planarity of subdivisions (extended abstract), The unpredictable deviousness of models, VRONI: An engineering approach to the reliable and efficient computation of Voronoi diagrams of points and line segments, Efficient algorithms and implementations for optimizing the sum of linear fractional functions, with applications, THE L∞ VORONOI DIAGRAM OF SEGMENTS AND VLSI APPLICATIONS, A CASE STUDY IN ALGORITHM ENGINEERING FOR GEOMETRIC COMPUTING, An elementary algorithm for reporting intersections of red/blue curve segments, Robust Point-Location in Generalized Voronoi Diagrams, Checking the convexity of polytopes and the planarity of subdivisions, Robustness of \(k\)-gon Voronoi diagram construction, Reporting intersections among thick objects., Algebraic methods and arithmetic filtering for exact predicates on circle arcs, On constant factors in comparison-based geometric algorithms and data structures
Uses Software
