Connect the Dot: Computing Feed-Links with Minimum Dilation (Q3183440): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Created claim: DBLP publication ID (P1635): conf/wads/AronovBBKLLSS09, #quickstatements; #temporary_batch_1731547958265
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Sharp upper and lower bounds on the length of general Davenport-Schinzel sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear size binary space partitions for uncluttered scenes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Realistic input models for geometric algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The geometric dilation of finite point sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of the Union of $(\alpha,\beta)$-Covered Objects / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local polyhedra and geometric graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the best shortcut in a geometric network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the upper envelope of n line segments in O(n log n) time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4736844 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the Stretch Factor of Euclidean Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric Spanner Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4325546 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Motion planning in environments with low obstacle density / rank
 
Normal rank
Property / cites work
 
Property / cites work: On fat partitioning, fat covering and the union size of polygons / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: conf/wads/AronovBBKLLSS09 / rank
 
Normal rank

Latest revision as of 03:05, 14 November 2024

scientific article
Language Label Description Also known as
English
Connect the Dot: Computing Feed-Links with Minimum Dilation
scientific article

    Statements

    Connect the Dot: Computing Feed-Links with Minimum Dilation (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    20 October 2009
    0 references

    Identifiers