Pages that link to "Item:Q1165008"

The following pages link to On the equivalence of some rectangle problems (Q1165008):

Displaying 13 items.

• Approximate covering detection among content-based subscriptions using space filling curves (Q362593) (← links)
• Geometric containment and vector dominance (Q1093914) (← links)
• The expected size of some graphs in computational geometry (Q1106021) (← links)
• On O(\(\sqrt{n})\) time algorithm for the ECDF searching problem for arbitrary dimensions on a mesh-of-processors (Q1111382) (← links)
• Lower bounds for the addition-subtraction operations in orthogonal range queries and related problems (Q1124391) (← links)
• The space-optimal version of a known rectangle enclosure reporting algorithm (Q1391959) (← links)
• A new algorithm for rectangle enclosure reporting (Q1607019) (← links)
• Algorithms for three-dimensional dominance searching in linear space. (Q2583568) (← links)
• (Q3305368) (← links)
• On Dominance Reporting in 3D (Q3541072) (← links)
• A worst-case efficient algorithm for hidden-line elimination^† (Q3802610) (← links)
• Direct dominance of points (Q3802650) (← links)
• A unified approach to geometric problems using dual cone transformation: (Q4323401) (← links)