Roll G. Karlsson, Mark H. Overmars  Home/Search
Context Related
Links: DBLP | archive.cs.uu.nl/pub/RUU/...198618.pdf 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: cs.uu.nl/resear...EAR=&AUTH=&GRP= (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: A number of important problems in computational geometry are solved efficiently on 2- or 3-dimensional grids by means of scanline techniques. In the solutions to the maximal elements and closure problems, a factor log n is substituted by loglog u, where n is the set size and u the grid size. Next, by using a data structure introduced in the paper, the interval trie, previous solutions to the rectangle intersection and connected component problems are improved upon. Finally, a fast intersection... (Update)
Context of citations to this paper: More
...that do not dominate any red point. We denote this as the cleaning of the red (resp. blue) set w.r.t. the blue (resp. red) set. In [KO88], Karlsson and Overmars give an O(n log log u) time and O(u) space algorithm, which given n points in U 3 , computes the maximal elements....
.... column within rows, h; w) SCA constructs a minimal (h; w) staircase cover of M in time O(j Gammaj log log n) Karlsson and Overmars [13] use Johnson s priority queue in a similar manner to obtain an O(n log log n) algorithm for the maximal layers problem (see Theorem 3.1 in...
Cited by: More
The Rectangle Enclosure and Point-Dominance Problems.. - Gupta, Janardan, Smid.. (1994) (Correct)
Computational Geometry on the Grid: Traversal and.. - Schneider, Güting, de .. (1998) (Correct)
Queue Layouts and Staircase Covers of Matrices - Heath, Pemmaraju (1994) (Correct)
Active bibliography (related documents): More All
0.6: Implementation of the ROSE Algebra: Efficient Algorithms for.. - Güting, al. (Correct)
0.5: Monte Carlo Approximation of Form Factors with Error Bounded a.. - Pellegrini (1997) (Correct)
0.5: Coordinated Path Planning for Multiple Robots - Svestka, Overmars (1998) (Correct)
Similar documents based on text: More All
0.4: On Rectangular Visibility - Overmars, Wood (1986) (Correct)
0.3: Fast Scanline Processing of Useful Implicitly-Defined Shapes.. - Singh, Parent (1994) (Correct)
0.3: Computational Geometry on a Grid - An Overview - Overmars (1987) (Correct)
Related documents from co-citation: More All
3: the equivalence of some rectangle problems (context) - Edelsbrunner, Overmars - 1982
3: Computational Geometry: An Introduction (context) - Preparata, Shamos - 1985
3: An improved algorithm for the rectangle enclosure problem (context) - Lee, Preparata - 1982
BibTeX entry: (Update)
R.G. Karlsson and M.H. Overmars, "Scanline algorithms on a grid", BIT 28 (1988) 227--241. http://citeseer.ist.psu.edu/karlsson86scanline.html More
@article{ karlsson88scanline,
author = "Rolf G. Karlsson and Mark H. Overmars",
title = "Scanline Algorithms on a Grid",
journal = "BIT",
volume = "28",
number = "2",
pages = "227-241",
year = "1988",
url = "citeseer.ist.psu.edu/karlsson86scanline.html" }
Citations (may not include all citations):169 Algorithms for Reporting and Counting Geometric Intersection.. (context) - Bentley, Ottman - 1979 DBLP
46 Preserving Order in a Forest in Less Than Logarithmic Time a.. (context) - Boas - 1977 DBLP
41 Log-logarithmic Worst-case Range Queries Are Possible in Spa.. (context) - Willard - 1983
32 A Priority Queue in which Initialization and Queue Operation.. (context) - Johnson - 1982
31 On Finding the Maxima of a Set of Vectors (context) - Kun, Luccio et al. - 1975 ACM DBLP
27 the Identification of the Convex Hull of a Finite Set of Poi.. (context) - Jarvis - 1973
20 Upper Bounds for Sorting Integers on Random Access Machines (context) - Kirkpatrick, Reisch - 1984 ACM DBLP
14 New Trie Data Structures Which Support Very Fast Search Oper.. (context) - Willard - 1984 ACM DBLP
9 Algorithms in a Restricted Universe (context) - Karlsson - 1984 ACM
5 Expected Time Algorithm for the Planar Segment Intersection .. (context) - Myers, log - 1985
3 Intersecting is Easier than Sorting (context) - Chazelle - 1984 ACM DBLP
3 Workshop on Graphtheoretic Concepts in Computer Science (context) - Mller, Location - 1985
3 Computational Geometry on Integer Grids (context) - Keil, Kirkpatrick - 1981
3 Computing the Connected Components of Simple Rectilinear Geo.. (context) - Edelsbrunner, van Leeuwen et al. - 1984
2 Springer-Verlag (context) - Preparata, Shamos et al. - 1985
2 Locking Policies: Safety and Freedom for Deadlock (context) - Yannakakis, Papadimitriou et al. - 1979
2 Normalized Divide and Conquer (context) - Karlsson, Overmars
1 Workshop on Graphtheoretk Concepts in Computer Science (context) - Overmars, on et al. - 1985
1 Efficient Algoritlms for Enmerating Intersecting Intervals a.. (context) - McCreight - 1980
1 An Optimal Algorithm for Testing for Safety and Detecting De.. (context) - Soisalon-Soininen, Wood - 1982
1 and J.I. Munro, Proximity on a Grid, Proc. 2nd Symposium on .. (context) - Karlsson - 1985
1 A New Approach to Rectangle Intersections (context) - Edeisbrunner - 1983
The graph only includes citing articles where the year of publication is known.
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