On a class of O(n2) problems in computational geometry
- 1 October 1995
- journal article
- Published by Elsevier in Computational Geometry
- Vol. 5 (3) , 165-185
- https://doi.org/10.1016/0925-7721(95)00022-2
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- How hard are n 2 -hard problems?ACM SIGACT News, 1994
- Computational geometryACM SIGACT News, 1994
- Fat Triangles Determine Linearly Many HolesSIAM Journal on Computing, 1994
- The complexity of the free space for a robot moving amidst fat obstaclesComputational Geometry, 1993
- On the union of fat wedges and separating a collection of segments by a lineComputational Geometry, 1993
- Triangulating a simple polygon in linear timeDiscrete & Computational Geometry, 1991
- The complexity and construction of many faces in arrangements of lines and of segmentsDiscrete & Computational Geometry, 1990
- Topologically sweeping an arrangementJournal of Computer and System Sciences, 1989
- Worst-case optimal hidden-surface removalACM Transactions on Graphics, 1987
- Constructing the visibility graph for n-line segments in O(n2) timeInformation Processing Letters, 1985