Time-Space Trade-Off for Finding the k-Visibility Region of a Point in a Polygon

DOI10.1007/978-3-319-53925-6_24zbMath1430.68355arXiv1603.02853OpenAlexW2950036238MaRDI QIDQ2980918

Prosenjit Bose, Yeganeh Bahoo, Stephane Durocher, Bahareh Banyassady, Wolfgang Mulzer

Publication date: 5 May 2017

Published in: WALCOM: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1603.02853

zbMATH Keywords

time-space trade-off\(k\)-visibility regionmemory-constrained model

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (2)

Computing the \(k\)-visibility region of a point in a polygon ⋮ A space-time trade-off for computing the visibility polygon in the multi-pass model

Cites Work

• Unnamed Item
• Unnamed Item
• Computing a visibility polygon using few variables
• Space-time trade-offs for stack-based algorithms
• Selection from read-only memory and sorting with minimum data movement
• Multi-pass geometric algorithms
• Corrections to Lee's visibility polygon algorithm
• Recognizing polygons, or how to spy
• Modem illumination of monotone polygons
• Memory-constrained algorithms for simple polygons
• Coverage with k-Transmitters in the Presence of Obstacles
• Further Results on Bar k-Visibility Graphs
• Guard placement for efficient point-in-polygon proofs
• Parameters of Bar k-Visibility Graphs
• Visibility Algorithms in the Plane
• Intersecting convex sets by rays
• Graph Drawing

This page was built for publication: Time-Space Trade-Off for Finding the k-Visibility Region of a Point in a Polygon