Pages that link to "Item:Q5361676"

The following pages link to Towards in-place geometric algorithms and data structures (Q5361676):

Displaying 29 items.

• Reprint of: Memory-constrained algorithms for simple polygons (Q390167) (← links)
• Prune-and-search with limited workspace (Q473192) (← links)
• Memory efficient algorithms for cactus graphs and block graphs (Q528335) (← links)
• In-place algorithm for erasing a connected component in a binary image (Q692939) (← links)
• An in-place algorithm for Klee's measure problem in two dimensions (Q845997) (← links)
• In-place algorithms for computing (Layers of) maxima (Q848632) (← links)
• Space-efficient geometric divide-and-conquer algorithms (Q883238) (← links)
• Optimal in-place and cache-oblivious algorithms for 3-D convex hulls and 2-D segment intersection (Q991174) (← links)
• Speeding up the incremental construction of the union of geometric objects in practice. (Q1421031) (← links)
• LOOK: A lazy object-oriented kernel design for geometric computation (Q1602944) (← links)
• Time-space trade-offs for triangulations and Voronoi diagrams (Q1615777) (← links)
• Variations of largest rectangle recognition amidst a bichromatic point set (Q2201768) (← links)
• Dynamic geometric data structures via shallow cuttings (Q2223621) (← links)
• Frameworks for designing in-place graph algorithms (Q2237887) (← links)
• Two approaches to building time-windowed geometric data structures (Q2319633) (← links)
• Rectilinear path problems in restricted memory setup (Q2357163) (← links)
• Line-segment intersection made in-place (Q2385700) (← links)
• Memory-constrained algorithms for simple polygons (Q2391542) (← links)
• Space-efficient algorithms for computing the convex hull of a simple polygonal line in linear time (Q2489016) (← links)
• Computing (and Life) Is All about Tradeoffs (Q2848971) (← links)
• Succinct and Implicit Data Structures for Computational Geometry (Q2848977) (← links)
• Progressive Geometric Algorithms (Q2970436) (← links)
• Time-Space Trade-offs for Triangulations and Voronoi Diagrams (Q3449845) (← links)
• (Q3991310) (← links)
• A Framework for In-place Graph Algorithms (Q5009570) (← links)
• Optimal In-place Algorithms for Basic Graph Problems (Q5041185) (← links)
• (Q5088951) (← links)
• Geometric Streaming Algorithms with a Sorting Primitive (Q5387783) (← links)
• FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science (Q5465867) (← links)