A time-space trade-off for computing the \(k\)-visibility region of a point in a polygon (Q2272372): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2018.06.017 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2296295447 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Memory-constrained algorithms for simple polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2816363 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coverage with \(k\)-transmitters in the presence of obstacles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Space-time trade-offs for stack-based algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing a visibility polygon using few variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparison-based time-space lower bounds for selection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-pass geometric algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Selection and Sorting in the “Restore” Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Drawing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing polygons, or how to spy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Guard placement for efficient point-in-polygon proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameters of Bar k-Visibility Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersecting convex sets by rays / rank
 
Normal rank
Property / cites work
 
Property / cites work: Visibility Algorithms in the Plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Further Results on Bar k-Visibility Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Corrections to Lee's visibility polygon algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Selection from read-only memory and sorting with minimum data movement / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:21, 20 July 2024

scientific article
Language Label Description Also known as
English
A time-space trade-off for computing the \(k\)-visibility region of a point in a polygon
scientific article

    Statements

    A time-space trade-off for computing the \(k\)-visibility region of a point in a polygon (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    10 September 2019
    0 references
    limited workspace model
    0 references
    \(k\)-visibility region
    0 references
    time-space trade-off
    0 references

    Identifiers