The following pages link to The power of geometric duality (Q1082821):
Displaying 50 items.
- The geometry behind double geometry (Q271101) (← links)
- A solution to a problem of Grünbaum and Motzkin and of Erdős and Purdy about bichromatic configurations of points in the plane (Q375507) (← links)
- Crossing by lines all edges of a line arrangement (Q389464) (← links)
- All-maximum and all-minimum problems under some measures (Q396657) (← links)
- Linear space data structures for two types of range search (Q578916) (← links)
- The power of parallel projection (Q685515) (← links)
- Flip distance between triangulations of a simple polygon is NP-complete (Q894685) (← links)
- Range queries on uncertain data (Q897858) (← links)
- Bottleneck partial-matching Voronoi diagrams and applications (Q902422) (← links)
- An optimal algorithm for the boundary of a cell in a union of rays (Q911755) (← links)
- Searching for empty convex polygons (Q911758) (← links)
- Triangulating a nonconvex polytope (Q914375) (← links)
- Efficient binary space partitions for hidden-surface removal and solid modeling (Q914380) (← links)
- Combinatorial complexity bounds for arrangements of curves and spheres (Q917017) (← links)
- Partitioning arrangements of lines. II: Applications (Q921915) (← links)
- Topological sweep of the complete graph (Q1003474) (← links)
- Computing the least quartile difference estimator in the plane (Q1020878) (← links)
- The power of geometric duality revisited (Q1068550) (← links)
- Visibility of disjoint polygons (Q1087340) (← links)
- Heuristics and bounds for the travelling salesman location problem on the plane (Q1099066) (← links)
- Fractional cascading. II: Applications (Q1099958) (← links)
- Topologically sweeping an arrangement (Q1122981) (← links)
- Fast algorithms for collision and proximity problems involving moving geometric objects (Q1126250) (← links)
- Bounding the number of \(k\)-faces in arrangements of hyperplanes (Q1175787) (← links)
- On \(k\)-sets in arrangements of curves and surfaces (Q1179129) (← links)
- Arrangements of curves in the plane --- topology, combinatorics, and algorithms (Q1185003) (← links)
- Reporting points in halfspaces (Q1196295) (← links)
- Efficient partition trees (Q1199132) (← links)
- Implicitly representing arrangements of lines or segments (Q1263966) (← links)
- Stabbing information of a simple polygon (Q1283786) (← links)
- Iterated nearest neighbors and finding minimal polytopes (Q1327455) (← links)
- Better lower bounds on detecting affine and spherical degeneracies (Q1346125) (← links)
- Erased arrangements of linear and convex decompositions of polyhedra (Q1384196) (← links)
- Illumination by floodlights (Q1388133) (← links)
- On the complexity of halfspace area queries (Q1422232) (← links)
- Efficient searching with linear constraints (Q1591152) (← links)
- Constructing arrangements optimally in parallel (Q1802221) (← links)
- Applications of random sampling in computational geometry. II (Q1823685) (← links)
- Robot motion planning and the single cell problem in arrangements (Q1842755) (← links)
- Reporting intersecting pairs of convex polytopes in two and three dimensions (Q1862123) (← links)
- Dynamic half-space range reporting and its applications (Q1891228) (← links)
- Point set pattern matching in \(d\)-dimensions (Q1891233) (← links)
- Assembly sequences for polyhedra (Q1892580) (← links)
- A linear-time algorithm for constructing a circular visibility diagram (Q1897474) (← links)
- Lower bounds for set intersection queries (Q1899448) (← links)
- Parallel algorithms for arrangements (Q1907232) (← links)
- Algorithms for generalized halfspace range searching and other intersection searching problems (Q1917041) (← links)
- On the restricted 1-Steiner tree problem (Q2019490) (← links)
- On the restricted \(k\)-Steiner tree problem (Q2084651) (← links)
- On the number of hyperedges in the hypergraph of lines and pseudo-discs (Q2161213) (← links)
