D.T. Lee  Home/Search
Context Related
| nwu.edu/~dtlee/CRC...ndbook_chap19.ps.Z Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: nwu.edu/~dtlee/publication (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Introduction Computational geometry, since its inception[41] in 1975, has received a great deal of attention from researchers in the area of design and analysis of algorithms. It has evolved into a discipline of its own. It is concerned with the computational complexity of geometric problems that arise in various disciplines such as pattern recognition, computer graphics, geographical information system, computer vision, CAD/CAM, robotics, VLSI layout, operations research, statistics, etc. In... (Update)
Context of citations to this paper: More
...the problem can be done fairly easily by a plane sweep technique. For a more detailed description of plane sweep technique, see, e.g. [35] or Section 5.1 below. Assume that the set S of points p 1 ; p 2 ; p n are ordered in nondescending order of their x...
...a large collection of excellent surveys in both general and specific areas of computational geometry. For examples of general surveys see [40], and [44] On the other hand, a survey of the most recent results in computational geometry most relevant for solving pattern...
Cited by: More
Non-evaluated manipulation of complex CSG solids - Rafael Segura Francisco (2004) (Correct)
Advances in Computational Geometry for Document Analysis - Toussaint (Correct)
Computational Geometry I - Lee (1996) (Correct)
Similar documents (at the sentence level):
8.9%: Computational Geometry - Lee (1996) (Correct)
Active bibliography (related documents): More All
0.6: Planar Separators and Parallel Polygon Triangulation - Goodrich (1992) (Correct)
0.4: Surface Triangulation: A Survey - Kumar (1996) (Correct)
0.2: The Quickhull Algorithm for Convex Hulls - Barber, Dobkin, Huhdanpaa (1995) (Correct)
Similar documents based on text: More All
0.1: A Faster One-Dimensional Topological Compaction Algorithm - With Jog Insertion (Correct)
0.0: Geometric Algorithm Visualization, Current Status and Future - Lee (1996) (Correct)
0.0: Towards Web-Based Computing - Aoki, Lee (1999) (Correct)
Related documents from co-citation: More All
3: Computational Geometry: An Introduction (context) - Preparata, Shamos - 1985
2: CRC Press LLC (context) - Goodman, O'Rourke et al. - 1997
2: Handbook of Computational Geometry (context) - Sack, Urrutia - 1997
BibTeX entry: (Update)
D. T. Lee, "Computational Geometry," Computer Science and Engineering Handbook, Ed. A. Tucker, CRC Press, 1996, 111-140. http://citeseer.ist.psu.edu/article/lee96computational.html More
@article{ lee96computational,
author = "D. T. Lee",
title = "Computational geometry",
journal = "ACM Computing Surveys",
volume = "28",
number = "1",
pages = "27--31",
year = "1996",
url = "citeseer.ist.psu.edu/article/lee96computational.html" }
Citations (may not include all citations):1254 Computational Geometry: An Introduction (context) - Preparata, Shamos - 1988
481 Algorithms in Combinatorial Geometry (context) - Edelsbrunner - 1987
335 Applications of Random Sampling in Computational Geometry, I.. - Clarkson, Shor - 1989
180 Triangulating a Simple Polygon in Linear Time (context) - Chazelle - 1991
125 Art Gallery Theorems and Algorithms (context) - O'Rourke - 1987
91 Computational Geometry Algorithms and Applications (context) - de Berg, van Kreveld et al. - 1997
86 Constrained Delaunay Triangulations (context) - Chew - 1989
73 Fast Detection of Polyhedral Intersection (context) - Dobkin, Kirkpatrick - 1983
62 Recent Results in Art Galleries (context) - Shermer - 1992
57 Geometric Applications of a matrix-Searching Algorithm (context) - Aggarwal, Klawe et al. - 1987
57 Scaling and Related Techniques for Geometry Problems (context) - Gabow, Bentley et al. - 1984
48 Triangulating simple polygons and equivalent problems (context) - Fournier, Montuno - 1984
36 Generalized Delaunay Triangulation for Planar Graphs (context) - Lee, Lin - 1986
35 How Good are Convex Hull Algorithms - Avis, Bremner et al. - 1997
34 Decomposing a Polygon into Simpler Components (context) - Keil - 1985
29 Linear-Size Nonobtuse Triangulation of Polygons - Bern, Mitchell et al. - 1994
29 Geometric Complexity of Some Location Problems (context) - Lee, Wu - 1986
28 Convex Decomposition of Polyhedra and Robustness (context) - Bajaj, Dey - 1992
25 the Difficulty of Triangulating Three-Dimensional Nonconvex .. (context) - Ruppert, Seidel - 1992
25 Triangulation and shape-complexity (context) - Chazelle, Incerpi - 1984
24 Triangulating a Non-Convex Polytope (context) - Chazelle, Palios - 1990
24 Computational Geometry (context) - Yao - 1994
23 the Convex Layers of a Planar Set (context) - Chazelle - 1985
22 A Deterministic Algorithm for the Three-Dimensional Diameter.. - Matousek, Schwarzkopf - 1993
22 CRC Press LLC (context) - Goodman, O'Rourke et al. - 1997
21 A Fast Las Vegas Algorithm for Triangulating a Simple Polygo.. (context) - Clarkson, Tarjan et al. - 1989
20 A Quadratic Time Algorithm for the Minmax Length Triangulati.. (context) - Edelsbrunner, Tan - 1993
19 Handbook of Computational Geometry (context) - Sack, Urrutia - 1997
13 Efficient Algorithms for Geometric Graph Search Problems (context) - Imai, Asano - 1986
12 Matrix Searching with the Shortest Path Metric - Hershberger, Suri - 1993
12 Partitioning a Polygonal Region into Trapezoids (context) - Asano, Asano et al. - 1986
11 The Ultimate Planar Convex Hull Algorithm (context) - Kirkpatrick, Seidel - 1986
10 An Optimal Convex Hull Algorithm for Point Sets in Any Fixed.. (context) - Chazelle - 1993
9 New Results in Computational Geometry Relevant to Pattern Re.. (context) - Toussaint - 1986
8 Parallel Techniques for Computational Geometry (context) - Atallah - 1992
8 An O(n log log n)-time Algorithm for Triangulating a Simple .. (context) - Tarjan, Van Wyk - 1988
5 An Efficient Algorithm for Maxdominance with Applications (context) - Atallah, Kosaraju - 1989
5 Polygon Triangulation: Efficiency and Minimality (context) - Asano, Asano et al. - 1986
4 The Parallel 3D Convex Hull Problem Revisited (context) - Amato, Preparata - 1992
4 in Computational Geometry - Fortune, Geometry et al. - 1993
4 Output-Sensitive Results on Convex Hulls, Extreme Points, an.. - Chan - 1995
3 Computational Geometry - Lee - 1996
3 World Scientific Publishing Co (context) - Du, Hwang et al. - 1992
2 An O(n log 2 h) Time Algorithm for the Three-Dimensional Con.. (context) - Edelsbrunner, Shi - 1991
2 Polygon Triangulation in O(n log log n) Time with Simple Dat.. (context) - Kirkpatrick, Klawe et al. - 1990
1 Construction of 1-D Lower Envelopes and Applications (context) - Ramos - 1997
1 Orthogonal Weighted Linear L 1 and L1 Approximation and Appl.. (context) - Houle, Imai et al. - 1993
1 The Boolean Basis Problem and How to Cover Some Polygons wit.. (context) - Lubiw - 1990
Documents on the same site (http://web.eecs.nwu.edu/~dtlee/publication.html): More
On Crossing Minimization Problem - Chen, Lee (1998) (Correct)
An Optimal Algorithm for Shortest Paths on Weighted.. - Atallah, Chen, Lee (1995) (Correct)
Computational Geometry II - Lee (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC