Abstract
Randomized, optimal algorithms to find a partition of the plane induced by a set of algebraic segments of a bounded degree, and a set of linear chains of a bounded degree, are given. This paper also provides a new technique for clipping, called virtual clipping, whose overhead per window W depends logarithmically on the number if intersections between the borders of W and the input segments. In contrast, the overhead of the conventional clipping technique depends linearly on this number of intersections. As an application of virtual clipping, a new simple and efficient algorithm for plannar point location is given.
- 1 ~CANNY, J. The complexity of robot motion planning. Ph.D. dissertation. Massachusetts Institute ~of Technology, Cambridge, Mass, 1987.]] Google Scholar
Digital Library
- 2 ~CHAZELLE, B., AND EDELSBRUNNER, H. An optimal algorithm for intersecting line segments in ~the plane. In Proceedings of the 29th Annual Foundations of Computer Science. IEEE, New York, ~1988, pp. 590-600.]]Google Scholar
Digital Library
- 3 ~CL^RKSON, K. Applications of random sampling to computational geometry, II. In Proceedings ~of the 4th Annual ,4CM Sympostum on Computatlonal Geometry (Urbana-Champaign, Ill., ~June 6-8). ACM, New York, 1988, pp. 1-11.]] Google Scholar
Digital Library
- 4 ~EDAHIRO, M., KOKUBO, I., AND ASANO, T. A new point location algorithm and its practical ~efficiency--Comparison with existing algorithms. ACM Trans. Graphics 3, 2 (1984).]] Google Scholar
Digital Library
- 5 ~EDELSBRUNNER, H., GUIBAS, L., AND STOLFI, J. Optimal point location in monotone subdivisions. ~SIAM J. Comput. 15, 2 (1986), 317-340.]] Google Scholar
Digital Library
- 6 ~GUIBAS, L., AND SEIDEL, R. Computing convolutions by reciprocal search. Disc. Comput. Geom. ~2 (1987), 175-193.]] Google Scholar
Digital Library
- 7 ~KIRPATRIK, D. Optimal search in planar subdivisions. SIAMJ. Comput. 12, 1 (1983), 28-35]]Google Scholar
- 8 ~LIPTON, R., AND TARJAN, R. Applications of a planar separator theorem. In Proceedings ~of the 18th Annual Symposium on Foundatzons of Computer Science. IEEE, New York, 1977, ~pp. 162-170.]]Google Scholar
Digital Library
- 9 ~MAIRSON, H., GUIBAS, L., AND STOLFI, J. Reporting and counting intersections between two sets ~of line segments. In Proceedmgs of the N,4 TO Advanced Slztdy Institute Theoretical Foundations of ~Computer Graphics and CAD (I1 Ciocco, Castelvecchio Pascoli, Italy). Springer-Verlag, New York, ~1987.]]Google Scholar
- 10 ~MULMULEY, K. A fast planar partition algorithm, I. In Proceedings of the 29th Foundations of ~Computer Science. IEEE, New York, 1988, pp. 580-589 (full version to appear in a special ~computational geometry issue of the J. Symb. Logic').]]Google Scholar
Digital Library
- 11 ~MULMULEY, K. On levels in arrangements and Voronoi diagrams. Disc. Comput. Geom, to ~appear.]]Google Scholar
- 12 ~MULMULEY, K. On obstructions in relation to a fixed view point, in Proceedings of the 30th ~Annual Foundatwns of Computer Science. IEEE, New York, 1989, pp. 532-537.]]Google Scholar
- 13 ~MULMULEY, K. An efficient hidden surface removal algorithm (Proceedings of SIGGRAPH 89). ~Comput. Graph. 23, 3 (July 1989), 379-388.]] Google Scholar
Digital Library
- 14 ~PREPARATA, F., AND SHAMOS, m. Computational Geometry, An Introduction. Springer-Verlag, ~New York, 1985.]] Google Scholar
Digital Library
- 15 ~SARNAK, N., AND TARJAN, R. Planar point location using persistent search trees. Commun AC3! ~27, 7 (1986), 669-679.]] Google Scholar
Digital Library
- 16 ~SUTHERLAND, I. E., SPROULL, R. F., AND SCHUMACKER, R.A. A characterization often hidden- ~surface algorithms. Comput. Surveys 6, 1 (Mar. 1974), 1-55.]] Google Scholar
Digital Library
Index Terms
A fast planar partition algorithm, II
Recommendations
An Optimal Algorithm for Determining the Visibility of a Polygon from an Edge
In many computer applications areas such as graphics, automated cartography, image processing, and robotics the notion of visibility among objects modeled as polygons is a recurring theme. This paper is concerned with the visibility of a simple polygon ...
A new algorithm for the largest empty rectangle problem
AbstractA rectangleA and a setS ofn points inA are given. We present a new simple algorithm for the so-called largest empty rectangle problem, i.e., the problem of finding a maximum area rectangle contained inA and not containing any point ofS in its ...
On the boundary complexity of the union of fat triangles
FOCS '00: Proceedings of the 41st Annual Symposium on Foundations of Computer ScienceA triangle is said to be /spl delta/-fat if its smallest angle is at least /spl delta/<0. A connected component of the complement of the union of a family of triangles is called hole. It is shown that any family of /spl delta/-far triangles in the plane ...








Comments