Multi-pass geometric algorithms

DOI10.1007/S00454-006-1275-6MaRDI QIDQ866973zbMATH OpenOpenAlexFDO

Authors Timothy M. Chan, Eric Y. Chen

Publication date 14 February 2007

Published in Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00454-006-1275-6

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Linear programming (90C05)

Recommendations

• Multi-pass geometric algorithms
• scientific article; zbMATH DE number 480245
• Multi-core Implementations of Geometric Algorithms
• Progressive geometric algorithms
• Progressive geometric algorithms
• Parallel geometric algorithms for multi-core computers
• Parallel geometric algorithms for multi-core computers
• scientific article; zbMATH DE number 66476
• scientific article; zbMATH DE number 1182929
• scientific article; zbMATH DE number 1006218

Cited in

(29)

• Time-space trade-offs for triangulations and Voronoi diagrams
• Space-efficient algorithms for longest increasing subsequence
• Constant work-space algorithms for facility location problems
• Frameworks for designing in-place graph algorithms
• A time-space trade-off for computing the k-visibility region of a point in a polygon
• On constant factors in comparison-based geometric algorithms and data structures
• Memory-constrained algorithms for simple polygons
• Progressive geometric algorithms
• Time-space trade-off for finding the k-visibility region of a point in a polygon
• scientific article; zbMATH DE number 4178631 (Why is no real title available?)
• Space-efficient algorithms for longest increasing subsequence
• Massively parallel entity matching with linear classification in low dimensional space
• Time-space trade-offs for triangulations and Voronoi diagrams
• Reprint of: Memory-constrained algorithms for simple polygons
• Computing a visibility polygon using few variables
• Progressive geometric algorithms
• Prune-and-search with limited workspace
• Space-time trade-offs for stack-based algorithms
• A framework for in-place graph algorithms
• Optimal In-place Algorithms for Basic Graph Problems
• Distribution-sensitive algorithms
• Streaming algorithms for planar convex hulls
• Geometric streaming algorithm with A sorting primitive
• Multi-pass geometric algorithms
• Geometric Streaming Algorithms with a Sorting Primitive
• Sublinear Geometric Algorithms
• Simple multi-pass streaming algorithms for skyline points and extreme points
• Almost optimal superconstant-pass streaming lower bounds for reachability
• A space-time trade-off for computing the visibility polygon in the multi-pass model

This page was built for publication: Multi-pass geometric algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q866973)