Space-efficient geometric divide-and-conquer algorithms
DOI10.1016/J.COMGEO.2006.03.006zbMATH Open1185.68772OpenAlexW2114400222WikidataQ57009406 ScholiaQ57009406MaRDI QIDQ883238FDOQ883238
Authors: Prosenjit Bose, Anil Maheshwari, Pat Morin, Jason Morrison, Jan Vahrenhold, Michiel Smid 
Publication date: 4 June 2007
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.comgeo.2006.03.006
Recommendations
Nonnumerical algorithms (68W05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cites Work
- Introduction to algorithms
- Title not available (Why is that?)
- Applications of random sampling in computational geometry. II
- Time bounds for selection
- Towards in-place geometric algorithms and data structures
- LATIN 2004: Theoretical Informatics
- Stable minimum space partitioning in linear time
- Title not available (Why is that?)
- Title not available (Why is that?)
- Sorting multisets stably in minimum space
- Asymptotically efficient in-place merging
Cited In (10)
- Optimal in-place and cache-oblivious algorithms for 3-D convex hulls and 2-D segment intersection
- An in-place algorithm for Klee's measure problem in two dimensions
- In-place algorithms for computing (Layers of) maxima
- Rectilinear path problems in restricted memory setup
- Line-segment intersection made in-place
- Prune-and-search with limited workspace
- Intersections and circuits in sets of line segments
- Title not available (Why is that?)
- Variations of largest rectangle recognition amidst a bichromatic point set
- Memory efficient algorithms for cactus graphs and block graphs
Uses Software
This page was built for publication: Space-efficient geometric divide-and-conquer algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q883238)
