Pages that link to "Item:Q1903639"
From MaRDI portal
The following pages link to On a class of \(O(n^ 2)\) problems in computational geometry (Q1903639):
Displayed 19 items.
- Perfect binary space partitions (Q676587) (← links)
- Selecting distances in arrangements of hyperplanes spanned by points. (Q878011) (← links)
- Covering point sets with two disjoint disks or squares (Q929745) (← links)
- On triangulating three-dimensional polygons (Q1392846) (← links)
- On finding an empty staircase polygon of largest area (width) in a planar point-set (Q1405008) (← links)
- Preprocessing chains for fast dihedral rotations is hard or even impossible. (Q1410594) (← links)
- Speeding up the incremental construction of the union of geometric objects in practice. (Q1421031) (← links)
- Shattering a set of objects in 2D (Q1613422) (← links)
- Computing large planar regions in terrains, with an application to fracture surfaces (Q1827827) (← links)
- Approximate unions of lines and Minkowski sums (Q2369877) (← links)
- Open problems around exact algorithms (Q2473037) (← links)
- Subquadratic algorithms for 3SUM (Q2482729) (← links)
- Counting and representing intersections among triangles in three dimensions (Q2571213) (← links)
- COMPUTING THE SET OF ALL THE DISTANT HORIZONS OF A TERRAIN (Q3373053) (← links)
- GENERALIZING MONOTONICITY: ON RECOGNIZING SPECIAL CLASSES OF POLYGONS AND POLYHEDRA (Q3373056) (← links)
- On Faster Integer Calculations Using Non-arithmetic Primitives (Q3543338) (← links)
- An Improved Ray Shooting Method for Constructive Solid Geometry Models Via Tree Contraction (Q4513199) (← links)
- POLYGON CONTAINMENT AND TRANSLATIONAL IN-HAUSDORFF-DISTANCE BETWEEN SEGMENT SETS ARE 3SUM-HARD (Q4682166) (← links)
- REGION INTERVISIBILITY IN TERRAINS (Q5386744) (← links)