M.H. Overmars  Home/Search
Context
Related
| archive.cs.uu.nl/pub/RUU/...198908.pdf Cached: PS.gz PS PDF DjVu Image Update Help From: cs.uu.nl/resear...EAR=&AUTH=&GRP= (more) Homepages: M.Overmars HPSearch (Update Links) |
Rate this article:      (best)Comment on this article |
Abstract: This paper gives a basic introduction into some of the techniques and data structures developed in computational geometry with emphasis on their use in computer graphics applications. Due to the limited space only global ideas are outlined and no details are presented. References are added, in particular in a subsection "Further Reading" at the end of each section, for those that are interested in learning more about the topics treated (Update)
Active bibliography (related documents): More All
0.5: Backwards Analysis of Randomized Geometric Algorithms - Seidel (1992) (Correct)
0.5: Reporting Intersecting Pairs of Polytopes in Two.. - Agarwal, de Berg, .. (Correct)
0.3: Concatenable Structures for Decomposable Problems - van Kreveld, al. (1989) (Correct)
Similar documents based on text: More All
0.4: Parallel Aspects of Numerical Weather Prediction on a Grid of .. - Middelkoop, al. (1988) (Correct)
0.2: Computational Geometry on a Grid - An Overview - Overmars (1987) (Correct)
0.2: Teaching Computational Geometry - Overmars (1993) (Correct)
BibTeX entry: (Update)
@inproceedings{ overmars89computational,
author = "Mark H. Overmars",
title = "Computational Geometry and its Application to Computer Graphics",
booktitle = "Advances in Computer Graphics",
pages = "75-107",
year = "1989",
url = "citeseer.nj.nec.com/overmars89computational.html" }
Citations (may not include all citations):223 Primitives for the manipulation of general subdivisions and .. (context) - Guibas, Stolfi - 1985
137 Algorithms for reporting and counting geometric intersection.. (context) - Bentley, Ottmann
124 A sweepline algorithm for Voronoi diagrams (context) - Fortune - 1987
101 Optimal point location in a monotone subdivision (context) - Edelsbrunner, Guibas et al. - 1986
80 New applications of random sampling in computational geometr.. - Clarkson - 1987
61 An efficient algorithm for determining the convex hull of a .. (context) - Graham
55 Design and implementation of an efficient priority queue (context) - Boas, Kay et al. - 1977
41 EATC Monographs on Theoretical Computer Science (context) - Edelsbrunner - 1987
41 Preserving order in a forest in less than logarithmic time a.. (context) - Boas - 1977
24 Triangulating a simple polygon (context) - Garey, tI et al. - 1978
22 Hidden surface removal for rectangles (context) - Bern - 1988
19 A fast Las Vegas algorithm for triangulating a simple polygo.. (context) - Claxkson, Tarjan - 1988
16 Sur la sphere vide (context) - Delaunay - 1934
16 Finding the convex hull of a simple polygon (context) - Graham, Yo - 1983
14 New algorithms for special cases of the hidden line eliminat.. (context) - tI, Ottmann - 1987
12 Halfplanar range search in linear space and O (context) - Welzl - 1986
9 A polygonal approach to hidden line elimination (context) - Goodrich - 1987
9 a data structure for retrieval on composite keys (context) - tI, Bentley et al. - 1974
5 and other applications of geometric partitioning techniques (context) - Guibas, Overmars et al. - 1988
5 A note on dynamic range searching (context) - Edelsbrunner - 1981
3 An optimal algorithm for reporting intersections of rectangl.. (context) - Bentley, Wood
2 Voronoi diagrams - A survey (context) - Aurenhammer - 1988
2 An optimal algorithm for intersecting line segments in the p.. (context) - Chaelle, Edelsbrunner - 1988
1 Some methods of computationa] geometry applied to computer g.. (context) - Overmars, Seidel - 1984
1 A probabilistic algorithm for the post office problem (context) - Claxkson - 1985
1 Multidimensional binaxy seaxch trees used for sociated seaxc.. (context) - Bentley - 1975
1 Multidimensional binaxy search trees in databaze application.. (context) - Bentley - 1979
1 Decomposable seaxching problems (context) - Bentley - 1979
1 Data structures for range seaxching (context) - Bentley, -Yiedman - 1979
1 An improved algorithm for constructing k th-order Voronoi di.. (context) - Chaelle, Edelsbrunner - 1987
1 Quairatic bounds for hidden line elimination (context) - Dvi - 1986
1 Voronoi diagrams bazed on convex distance functions (context) - Chew - 1985
1 Efficient worst-caze data structures for ruge searching (context) - Bentley, Maurer - 1980
1 Information Theory IT (context) - Edelsbrunner, Kirkpatrick et al. - 1983
1 Convex hull of a nite set of points in two dimensions (context) - Bykat - 1978
1 Applications of random sampling in computational geometry II (context) - Claxkson - 1988
Documents on the same site (http://www.cs.uu.nl/research/techreps/techreps.php?submit=show+reports&YEAR=&AUTH=&GRP=): More
On the Two-Level Uncapacitated Facility Location Problem - Aardal, Labbé (1995) (Correct)
A Tourist Guide through Treewidth - Bodlaender (1993) (Correct)
Predictive Probabilistic Models for Treatment Planning in.. - Peek (Correct)
Online articles have much greater impact More about CiteSeer Add search form to your site Submit documents Feedback
CiteSeer - citeseer.org - Terms of Service - Privacy Policy - Copyright © 1997-2002 NEC Research Institute