Prosenjit Bose, Pat Morin  Home/Search
Context Related
| scs.carleton.ca/~m...aversalisaac00.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: scs.carleton.ca/~morin/index (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: . We describe an algorithm for enumerating all vertices, edges and faces of a planar subdivision stored in any of the usual pointer-based representations, while using only a constant amount of memory beyond that required to store the subdivision. The algorithm is a re nement of a method introduced by de Berg et al (1997), that reduces the worst case running time from O(n 2 ) to O(n log n). We also give experimental results that show that our modi ed algorithm runs faster not only in ... (Update)
Cited by: More
Traversal of a Quasi-Planar Subdivision without.. - Chavez, Dobrev.. (2004) (Correct)
Route Discovery with Constant Memory in Oriented.. - Chavez, Dobrev.. (2004) (Correct)
Routing with Guaranteed Delivery in ad hoc Wireless.. - Bose, Morin.. (1999) (Correct)
Similar documents (at the sentence level):
78.9%: An Improved Algorithm for Subdivision Traversal without Extra.. - Bose, Morin (1999) (Correct)
Active bibliography (related documents): More All
0.7: Online Routing in Geometric Graphs - Morin (2001) (Correct)
0.7: Simple Traversal of a Subdivision Without Extra Storage - de Berg, van Kreveld.. (1996) (Correct)
0.3: Bit Complexity of Breaking and Achieving Symmetry in.. - Dinitz, Moran, Rajsbaum (Correct)
Similar documents based on text: More All
0.4: Testing the Quality of Manufactured Disks and Balls - Bose, Morin (Correct)
0.3: Succinct Data Structures for Approximating Convex.. - Bose, Devroye, Morin (Correct)
0.2: On Simplifying Dot Maps - de Berg, Bose, Cheong, Morin (2003) (Correct)
Related documents from co-citation: More All
8: Compass routing on geometric networks - Kranakis, Singh et al. - 1999
6: Geocasting in mobile ad hoc networks: Location-based multicast algorithms - Ko, Vaidya - 1998
6: Location-aided routing (context) - Ko, Vaidya - 1998
BibTeX entry: (Update)
P. Bose and P. Morin. An improved algorithm for subdivision traversal without extra storage. Submitted, 1999. http://citeseer.ist.psu.edu/bose99improved.html More
@inproceedings{ bose00improved,
author = "Prosenjit Bose and Pat Morin",
title = "An Improved Algorithm for Subdivision Traversal without Extra Storage",
booktitle = "International Symposium on Algorithms and Computation",
pages = "444-455",
year = "2000",
url = "citeseer.ist.psu.edu/bose99improved.html" }
Citations (may not include all citations):375 LEDA A Platform for Combinatorial and Geometric Computing - Mehlhorn, aher - 1999
257 Primitives for the manipulation of general subdivisions and .. (context) - Guibas, Stol - 1985
114 Optimal point location in a monotone subdivision (context) - Edelsbrunner, Guibas et al. - 1986
58 and Oren Patashnik (context) - Graham, Knuth - 1994
40 Finding the intersection of two convex polyhedra (context) - Muller, Preparata - 1978
36 Principles of Geographical Information Systems for Land Reso.. (context) - Burrough - 1986
29 Preparata and Michael Ian Shamos (context) - Franco - 1985
14 Simple traversal of a subdivision without extra storage - de Berg, van Kreveld et al. - 1997
13 Automated contour mapping using triangular element data and .. (context) - Gold, Charters et al. - 1977
12 Spatially ordered networks and topographic reconstructions (context) - Gold, Cormack - 1986
8 INFO: An example of a contemporary geographic information sy.. (context) - Peuquet, Marble - 1990
6 Technical description of the DIME system (context) - Peuquet, Marble - 1990
5 Triangulation and spatial ordering in computer cartography (context) - Gold, Maydell - 1978
3 Decentralized extrema-nding in circular congurations of proc.. (context) - Hirschberg, Sinclair - 1980
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.scs.carleton.ca/~morin/index.html): More
The Role of Reductions in Cryptography - Morin (Correct)
Optimal Randomized Parallel Algorithms for Computational Geometry - Pat Morin (Correct)
A Critique of BEAR and LION - Morin (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