Algorithms - ESA 2003
From MaRDI portal
Publication:5897258
DOI10.1007/b13632zbMath1266.68192OpenAlexW1827234103WikidataQ60299159 ScholiaQ60299159MaRDI QIDQ5897258
Menelaos I. Karavelas, Mariette Yvinec
Publication date: 3 March 2010
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b13632
Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (7)
Abstract Voronoi diagrams revisited ⋮ Voronoi Diagram and Delaunay Triangulation with Independent and Dependent Geometric Uncertainties ⋮ Exact Voronoi diagram of smooth convex pseudo-circles: general predicates, and implementation for ellipses ⋮ A randomized incremental algorithm for the Hausdorff Voronoi diagram of non-crossing clusters ⋮ The predicates of the Apollonius diagram: algorithmic analysis and implementation ⋮ Abstract Voronoi Diagrams from Closed Bisecting Curves ⋮ On the complexity of higher order abstract Voronoi diagrams
This page was built for publication: Algorithms - ESA 2003
