Approximate unions of lines and Minkowski sums
From MaRDI portal
Publication:2369877
DOI10.1007/S00453-005-1191-9zbMath1117.68080OpenAlexW2096226935MaRDI QIDQ2369877
A. Frank van der Stappen, Marc J. van Kreveld
Publication date: 21 June 2007
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://dspace.library.uu.nl/handle/1874/17989
Cites Work
- Unnamed Item
- On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles
- Triangulating a simple polygon in linear time
- On the boundary of the union of planar convex sets
- Computing closely matching upper and lower bounds on textile nesting problems
- Algorithms for bichromatic line-segment problems and polyhedral terrains
- On the union of fat wedges and separating a collection of segments by a line
- Multiple translational containment. II: Exact algorithms
- Multiple translational containment. I: An approximate algorithm
- On fat partitioning, fat covering and the union size of polygons
- The complexity of the free space for motion planning amidst fat obstacles
- Sharp quantum versus classical query complexity separations
- On a class of \(O(n^ 2)\) problems in computational geometry
- On the complexity of the union of fat convex objects in the plane
- Dynamic data structures for fat objects and their applications
- On the Boundary Complexity of the Union of Fat Triangles
- Range Searching and Point Location among Fat Objects
- Fat Triangles Determine Linearly Many Holes
- Local polyhedra and geometric graphs
This page was built for publication: Approximate unions of lines and Minkowski sums
