Data structures and network algorithms
Data structures and network algorithms
Computational geometry: an introduction
Computational geometry: an introduction
Sorting Jordan sequences in linear time using level-linked search trees
Information and Control
On-line construction of the convex hull of a simple polyline
Information Processing Letters
Simplified linear-time Jordan sorting and polygon clipping
Information Processing Letters
Applications of random sampling in computational geometry, II
Discrete & Computational Geometry - Selected papers from the fourth ACM symposium on computational geometry, Univ. of Illinois, Urbana-Champaign, June 6 8, 1988
A fast Las Vegas algorithm for triangulating a simple polygon
Discrete & Computational Geometry - Selected papers from the fourth ACM symposium on computational geometry, Univ. of Illinois, Urbana-Champaign, June 6 8, 1988
Computational Geometry: Theory and Applications
Triangulating a simple polygon in linear time
Discrete & Computational Geometry
Polygon triangulation in O(n log log n) time with simple data structures
Discrete & Computational Geometry
Planar separators and parallel polygon triangulation
Journal of Computer and System Sciences - Special issue on selected papers presented at the 24th annual ACM symposium on the theory of computing (STOC '92)
Davenport-Schinzel sequences and their geometric applications
Davenport-Schinzel sequences and their geometric applications
Linear Algorithms for Partitioning Embedded Graphs of BoundedGenus
SIAM Journal on Discrete Mathematics
Efficient algorithms for geometric optimization
ACM Computing Surveys (CSUR)
Cartographic line simplification and polygon CSG formulæ in O(n log* n) time
WADS '97 Selected papers presented at the international workshop on Algorithms and data structure
Applying Parallel Computation Algorithms in the Design of Serial Algorithms
Journal of the ACM (JACM)
Placing two disks in a convex polygon
Information Processing Letters
Packing two disks in a polygon
Computational Geometry: Theory and Applications
Algorithms for Packing Two Circles in a Convex Polygon
JCDCG '98 Revised Papers from the Japanese Conference on Discrete and Computational Geometry
ESA '95 Proceedings of the Third Annual European Symposium on Algorithms
Computing hereditary convex structures
Proceedings of the twenty-fifth annual symposium on Computational geometry
| Hi-index | 0.00 |
We give three related algorithmic results concerning a simple polygon P: 1. Improving a series of previous work, we show how to find a largest pair of disjoint congruent disks inside P in linear expected time. 2. As a subroutine for the above result, we show how to find the convex hull of any given subset of the vertices of P in linear worst-case time. 3. More generally, we show how to compute a triangulation of any given subset of the vertices or edges of P in almost linear time.