Pages that link to "Item:Q1880211"

The following pages link to Binary space partitions for axis-parallel segments, rectangles, and hyperrectangles (Q1880211):

Displaying 16 items.

• An improved algorithm for Klee's measure problem on fat boxes (Q419375) (← links)
• Binary plane partitions for disjoint line segments (Q540437) (← links)
• Cuttings for disks and axis-aligned rectangles in three-space (Q848675) (← links)
• An \(O(n^{5/2}\log n)\) algorithm for the rectilinear minimum link-distance problem in three dimensions (Q1025292) (← links)
• A (slightly) faster algorithm for Klee's measure problem (Q1037647) (← links)
• On the optimal binary plane partition for sets of isothetic rectangles (Q1209352) (← links)
• Binary space partitions for axis-parallel line segments: Size-height tradeoffs. (Q1853137) (← links)
• On constant factors in comparison-based geometric algorithms and data structures (Q2349854) (← links)
• Exact size of binary space partitionings and improved rectangle tiling algorithms (Q2784515) (← links)
• Optimal binary space partitions for orthogonal objects (Q3990617) (← links)
• Binary Space Partitions for Line Segments with a Limited Number of Directions (Q4706194) (← links)
• (Q4828969) (← links)
• Binary Space Partitions of Orthogonal Subdivisions (Q5317202) (← links)
• Algorithms - ESA 2003 (Q5897271) (← links)
• Faster algorithms for largest empty rectangles and boxes (Q6174805) (← links)
• Decomposing the complement of the union of cubes and boxes in three dimensions (Q6624162) (← links)