The common exterior of convex polygons in the plane
Open Access
- 31 August 1997
- journal article
- Published by Elsevier in Computational Geometry
- Vol. 8 (3) , 139-149
- https://doi.org/10.1016/s0925-7721(96)00004-1
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Voronoi diagrams of rigidly moving sets of pointsInformation Processing Letters, 1992
- The number of edges of many faces in a line segment arrangementCombinatorica, 1992
- Construction of ɛ-netsDiscrete & Computational Geometry, 1990
- An optimal algorithm for the boundary of a cell in a union of raysAlgorithmica, 1990
- The complexity and construction of many faces in arrangements of lines and of segmentsDiscrete & Computational Geometry, 1990
- Combinatorial complexity bounds for arrangements of curves and spheresDiscrete & Computational Geometry, 1990
- Applications of random sampling in computational geometry, IIDiscrete & Computational Geometry, 1989
- Planar realizations of nonlinear davenport-schinzel sequences by segmentsDiscrete & Computational Geometry, 1988
- On the maximal number of edges of many faces in an arrangementJournal of Combinatorial Theory, Series A, 1986
- On the union of Jordan regions and collision-free translational motion amidst polygonal obstaclesDiscrete & Computational Geometry, 1986