On the number of regular vertices of the union of jordan regions
- 1 March 2001
- journal article
- research article
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 25 (2) , 203-220
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- On the Complexity of the Union of Fat Convex Objects in the PlaneDiscrete & Computational Geometry, 2000
- On the Boundary of the Union of Planar Convex SetsDiscrete & Computational Geometry, 1999
- The common exterior of convex polygons in the planeComputational Geometry, 1997
- On disjoint concave chains in arrangements of (pseudo) linesInformation Processing Letters, 1994
- Algorithms for bichromatic line-segment problems and polyhedral terrainsAlgorithmica, 1994
- Fat Triangles Determine Linearly Many HolesSIAM Journal on Computing, 1994
- Cutting hyperplanes for divide-and-conquerDiscrete & Computational Geometry, 1993
- On disjoint concave chains in arrangements of (pseudo) linesInformation Processing Letters, 1991
- New applications of random sampling in computational geometryDiscrete & Computational Geometry, 1987
- On the union of Jordan regions and collision-free translational motion amidst polygonal obstaclesDiscrete & Computational Geometry, 1986