Realistic input models for geometric algorithms
From MaRDI portal
Publication:1849788
DOI10.1007/s00453-002-0961-xzbMath1017.68141OpenAlexW1979838628MaRDI QIDQ1849788
Matthew J. Katz, Jules Vleugels, A. Frank van der Stappen, Mark T. de Berg
Publication date: 1 December 2002
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://dspace.library.uu.nl/handle/1874/18742
Nonnumerical algorithms (68W05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (30)
Space complexity of exact discrete geodesic algorithms on regular triangulations ⋮ An optimal-time algorithm for shortest paths on realistic polyhedra ⋮ COMPUTING PUSH PLANS FOR DISK-SHAPED ROBOTS ⋮ Connect the Dot: Computing Feed-Links with Minimum Dilation ⋮ Delaunay Triangulation of Imprecise Points Simplified and Extended ⋮ Approximation Algorithms for Polynomial-Expansion and Low-Density Graphs ⋮ Maximum matchings in geometric intersection graphs ⋮ Kinetic Geodesic Voronoi Diagrams in a Simple Polygon ⋮ Tight lower bounds for halfspace range searching ⋮ Guarding scenes against invasive hypercubes. ⋮ Approximating the Fréchet distance for realistic curves in near linear time ⋮ Spanning trees crossing few barriers ⋮ The Complexity of Bisectors and Voronoi Diagrams on Realistic Terrains ⋮ Union of random Minkowski sums and network vulnerability analysis ⋮ I/O-Efficient Map Overlay and Point Location in Low-Density Subdivisions ⋮ Approximate Range Searching in External Memory ⋮ On realistic terrains ⋮ Approximating the Packedness of Polygonal Curves ⋮ Bounding the locus of the center of mass for a part with shape variation ⋮ Approximate range searching using binary space partitions ⋮ A note on the perimeter of fat objects ⋮ Computing the visibility map of fat objects ⋮ Star-quadtrees and guard-quadtrees: I/O-efficient indexes for fat triangulations and low-density planar subdivisions ⋮ Models and motion planning ⋮ Balanced line separators of unit disk graphs ⋮ Smoothed analysis of probabilistic roadmaps ⋮ Decompositions and boundary coverings of non-convex fat polyhedra ⋮ Approximating the packedness of polygonal curves ⋮ Reprint of: Bounding the locus of the center of mass for a part with shape variation ⋮ Unnamed Item
This page was built for publication: Realistic input models for geometric algorithms
