Space–Query-Time Tradeoff for Computing the Visibility Polygon (Q5321702): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Partitioning arrangements of lines. I: An efficient deterministic algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Visibility queries and maintenance in simple polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Visibility of disjoint polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cutting hyperplanes for divide-and-conquer / rank
 
Normal rank
Property / cites work
 
Property / cites work: The power of geometric duality / rank
 
Normal rank
Property / cites work
 
Property / cites work: New applications of random sampling in computational geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4947407 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Zone Theorem for Hyperplane Arrangements / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal Algorithm for Computing Visibility in the Plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Construction of \(\epsilon\)-nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: THE VISIBILITY COMPLEX / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3358267 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient computation of query point visibility in polygons with holes / rank
 
Normal rank

Latest revision as of 18:28, 1 July 2024

scientific article; zbMATH DE number 5578469
Language Label Description Also known as
English
Space–Query-Time Tradeoff for Computing the Visibility Polygon
scientific article; zbMATH DE number 5578469

    Statements

    Identifiers