Space–Query-Time Tradeoff for Computing the Visibility Polygon
From MaRDI portal
Publication:5321702
DOI10.1007/978-3-642-02270-8_14zbMATH Open1248.68527OpenAlexW1920319052MaRDI QIDQ5321702FDOQ5321702
Authors: Mostafa Nouri, Mohammad Ghodsi
Publication date: 14 July 2009
Published in: Frontiers in Algorithmics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-02270-8_14
Recommendations
- Space/query-time tradeoff for computing the visibility polygon
- Visibility queries in a polygonal region
- Efficient visibility queries in simple polygons
- Time-space trade-off for finding 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
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cites Work
- New applications of random sampling in computational geometry
- The power of geometric duality
- Title not available (Why is that?)
- On the Zone Theorem for Hyperplane Arrangements
- Cutting hyperplanes for divide-and-conquer
- THE VISIBILITY COMPLEX
- Visibility queries and maintenance in simple polygons
- An Optimal Algorithm for Computing Visibility in the Plane
- Visibility of disjoint polygons
- Title not available (Why is that?)
- Construction of \(\epsilon\)-nets
- Partitioning arrangements of lines. I: An efficient deterministic algorithm
- Efficient computation of query point visibility in polygons with holes
Cited In (2)
This page was built for publication: Space–Query-Time Tradeoff for Computing the Visibility Polygon
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5321702)