Michael T. Goodrich, Mikhail J. Atallah, Mark H. Overmars  Home/Search
Context Related
| jhu.edu/~goodrich/cgc...gaoosmrh93.ps 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: jhu.edu/~goodrich/cgc/pub...index (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We present an algorithm for the hidden-surface elimination problem for rectangles, which is also known as window rendering. The time complexity of our algorithm is dependent on both the number of input rectangles, n, and on the size of the output, k. Our algorithm obtains a trade-off between these two components, in that its running time is O(r(n 1 1=r k)), where 1 r log n is a tunable parameter. By using this method while adjusting the parameter r "on the fly" one can achieve a running time... (Update)
Context of citations to this paper: More
...in the visibility map. Many of these algorithms are designed to work for specific classes of inputs: rectangles and orthogonal objects [17, 50, 86], polyhedral terrains [59, 85, 87] and objects whose unions have small size [59] de Berg et al. 36] present a general algorithm...
.... cation of our algorithm solves this problem in time O(n log 2 n t log n p) which compares favorably with the best analytic solutions [8, 22]. If the pixels form a regular grid, we can improve the running time to O(n log 2 n t log n) using the sweepline approach. Note that...
Cited by: More
Trends and Developments in Computational Geometry - de Berg (1995) (Correct)
Finite-Resolution Hidden Surface Removal - Erickson (Correct)
Efficient Hidden-Surface Removal in Theory and in Practice - Murali (1999) (Correct)
Active bibliography (related documents): More All
1.8: A Polygonal Approach to Hidden-Line and Hidden-Surface Elimination - Goodrich (1999) (Correct)
0.7: Efficient Hidden Surface Removal for Objects with Small.. - Katz, Overmars, Sharir (1992) (Correct)
0.6: Randomized Search Trees - Seidel (1996) (Correct)
Similar documents based on text: More All
0.4: Secure Biometric Authentication for Weak Computational .. - Atallah, Frikken.. (2005) (Correct)
0.3: Scanline Algorithms on a Grid - Karlsson, Overmars (1986) (Correct)
0.2: Translating Polygons with Applications to Hidden Surface Removal - de Berg (1989) (Correct)
Related documents from co-citation: More All
5: Ray shooting and parametric search (context) - Agarwal, Matousek - 1993
4: Worst-case optimal hidden-surface removal (context) - McKenna - 1987
4: Hidden surface removal for rectangles (context) - Bern - 1990
BibTeX entry: (Update)
M. T. Goodrich, M. J. Atallah, and M. H. Overmars, Output-sensitive methods for rectilinear hidden surface removal, Inform. Comput., 107 (1993), 1--24. http://citeseer.ist.psu.edu/goodrich93outputsensitive.html More
@article{ goodrich93outputsensitive,
author = "Michael T. Goodrich and Mikhail J. Atallah and Mark H. Overmars",
title = "Output-Sensitive Methods for Rectilinear Hidden Surface Removal",
journal = "Information and Computation",
volume = "107",
number = "1",
pages = "1-24",
year = "1993",
url = "citeseer.ist.psu.edu/goodrich93outputsensitive.html" }
Citations (may not include all citations):1450 The Design and Analysis of Computer Algorithms (context) - Aho, Hopcroft et al. - 1974
1254 Computational Geometry: An Introduction (context) - Preparata, Shamos - 1985
257 Primitives for the Manipulation of General Subdivisions and .. (context) - Guibas, Stolfi - 1985
127 A Linear-Time Algorithm for a Special Case of Disjoint Set U.. (context) - Gabow, Tarjan - 1983
93 A Characterization of Ten HiddenSurface Algorithms (context) - Sutherland, Sproull et al. - 1974
69 Filtering Search: A New Approach to Query-Answering (context) - Chazelle - 1986
62 Introduction to Algorithms: A Creative Approach (context) - Manber - 1989
57 A Polyhedron Representation for Computer Vision (context) - Baumgart - 1975
40 Finding the Intersection of Two Convex Polyhedra (context) - Muller, Preparata - 1978
32 Design and Implementation of an Efficient Priority Queue (context) - Boas, Kaas et al. - 1977
31 Worst-case Optimal Hidden-Surface Removal (context) - McKenna - 1987
25 An Optimal Worst Case Algorithm for Reporting Intersections .. (context) - Bentley, Wood - 1980
22 Hidden Surface Removal for Rectangles (context) - Bern - 1988
22 Hidden Surface Removal for Rectangles (context) - Bern
14 Time and Space Bounds for Hidden Line and Hidden Surface Alg.. (context) - Schmitt
14 New Algorithms For Special Cases of the Hidden Line Eliminat.. (context) - Guting, Ottmann - 1987
14 A Fast Line-Sweep Algorithm For Hidden Line Elimination (context) - Nurmi - 1985
14 Output-Sensitive Hidden Surface Removal (context) - Overmars, Sharir - 1989
11 Computation of the Axial View of a Set of Isothetic Parallel.. (context) - Preparata, Vitter et al. - 1988
10 Quadratic Bounds for Hidden-Line Elimination (context) - D'evai - 1986
9 A Polygonal Approach to Hidden-Line Elimination (context) - Goodrich - 1987
4 private communication (context) - Paterson - 1989
3 Intersecting is Easier Than Sorting (context) - Chazelle - 1984
3 the Time and Space Complexity of Certain Exact Hidden Line A.. (context) - Schmitt - 1981
3 private communication (context) - Mehlhorn - 1989
3 Solving Visibility Problems by Using Skeleton Structures (context) - Ottmann, Widmayer - 1984
2 A Visibility Polygon Reconstruction Algorithm (context) - Sechrest, Greenberg - 1982
1 Visibility Problems for Orthogonal Objects in Two- or Three-.. (context) - Doh
1 An Optimal Query-Update Structure for the Interval Valuation.. (context) - Larmore - 1989
1 Presevering Order in a Forest in Less than Logarithmic Time .. (context) - Boas - 1977
Documents on the same site (http://www.cs.jhu.edu/~goodrich/cgc/pubs/index.html): More
Efficient Approximation and Optimization Algorithms for.. - Duncan, Goodrich, al. (1997) (Correct)
Randomized Fully-Scalable BSP Techniques for Multi-Searching and .. - Goodrich (1997) (Correct)
Communication-Efficient Parallel Sorting - Goodrich (1996) (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