(Enter summary)
Abstract: In this paper an overview is given of a number of algorithms solving problems
in computational geometry on a grid, i.e., in the case where objects have
integer coordinates in some bounded universe. The emphasis is on simple,
yet efficient solutions. Especially problems with some relevance to computer
graphics are studied. (Update)
Context of citations to this paper: More
.... stabbing problem can be solved using a number of well known data structures such as interval tree [8] segment tree [2] interval trie [15], etc. see [3] for an excellent survey) However, these data structures were designed for handling the more general situation in which...
Cited by: More
Virtual Reality in Assembly Simulation - Collision Detection.. - Zachmann (2000)
(Correct)
Multi-Method Dispatching: A Geometric Approach with.. - Ferragina.. (1999)
(Correct)
Efficient dynamic method-lookup for object oriented languages .. - Ferragina, al. (1996)
(Correct)
Active bibliography (related documents): More All
0.4: Scanline Algorithms on a Grid - Karlsson, Overmars (1986)
(Correct)
0.3: Output-Sensitive Methods for Rectilinear Hidden Surface.. - Goodrich, Atallah.. (1993)
(Correct)
0.1: Bounded Ordered Dictionaries in O(log log N) Time and O(n) Space - Mehlhorn, Näher
(Correct)
Similar documents based on text: More All
0.2: Computational geometry and its Application to Computer Graphics - Overmars (1989)
(Correct)
0.2: Efficient Data Structures for Range Searching on a Grid - Overmars (1987)
(Correct)
0.1: Finding Grid Embeddings with Bounded Maximum Edge Length is.. - Bodlaender (1985)
(Correct)
Related documents from co-citation: More All
2: The Quickhull Algorithm for Convex Hull
- Barber, Dobkin et al. - 1993
2: Efficient Data Structures for Range Searching on a Grid
- Overmars - 1988
2: Time space tradeoffs for method look-up in objected oriented programs (context) - Muthukrishnan, Muller - 1996
BibTeX entry: (Update)
M. H. Overmars. Computational geometry on a grid: an overview, NATO ASI Series, vol. F40, 167--184, 1988. http://citeseer.ist.psu.edu/overmars87computational.html More
@inproceedings{ overmars88computational,
author = "Mark H. Overmars",
title = "Computational geometry on a grid: An overview",
booktitle = "Theoretical Foundations of Computer Graphics and {CAD}",
volume = "F40",
publisher = "Springer-Verlag",
editor = "R. A. Earnshaw",
pages = "167--184",
year = "1988",
url = "citeseer.ist.psu.edu/overmars87computational.html" }
Citations (may not include all citations):
169
Algorithms for reporting and counting geo- metric intersecti.. (context) - Bentley, Ottmann - 1979
148
Storing a sparse table with O (context) - Fredman, Komlos et al. - 1984
68
An efficient algorithm for determining the convex hull of a .. (context) - Graham - 1972
32
A priority queue in which initialization and queue operation.. (context) - Johnson - 1982
9
Algorithms in a restricted universe (context) - Karlsson - 1984
3
Intersecting is easier than sorting (context) - Chazelle - 1984
1
Another efficient algorithm for convex huns in two dimension.. (context) - Andrew - 1979
1
Scaling and related techniques for geometric problems (context) - Gabow, Bentley et al. - 1984
1
on Theoretical Aspects of Comp (context) - Karlsson, Munro - 1985
1
New trie data structures which support very fast search oper.. (context) - winard - 1984
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 (1998)
(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