Multi-pass geometric algorithms

DOI10.1007/S00454-006-1275-6zbMATH Open1106.68111OpenAlexW2001552595MaRDI QIDQ866973FDOQ866973

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

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

Mathematics Subject Classification ID

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

Cited In (24)

• Geometric Streaming Algorithms with a Sorting Primitive
• A time-space trade-off for computing the \(k\)-visibility region of a point in a polygon
• Computing a visibility polygon using few variables
• Time-space trade-offs for triangulations and Voronoi diagrams
• Memory-constrained algorithms for simple polygons
• Time-Space Trade-Off for Finding the k-Visibility Region of a Point in a Polygon
• Title not available (Why is that?)
• Frameworks for designing in-place graph algorithms
• On constant factors in comparison-based geometric algorithms and data structures
• Space-efficient algorithms for longest increasing subsequence
• Time-Space Trade-offs for Triangulations and Voronoi Diagrams
• Prune-and-search with limited workspace
• Title not available (Why is that?)
• A space-time trade-off for computing the visibility polygon in the multi-pass model
• Title not available (Why is that?)
• Space-time trade-offs for stack-based algorithms
• Space-Efficient Algorithms for Longest Increasing Subsequence
• Distribution-sensitive algorithms
• Optimal In-place Algorithms for Basic Graph Problems
• Constant work-space algorithms for facility location problems
• Geometric streaming algorithm with A sorting primitive
• A Framework for In-place Graph Algorithms
• Sublinear Geometric Algorithms
• Reprint of: Memory-constrained algorithms for simple polygons

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)