scientific article; zbMATH DE number 1424290
From MaRDI portal
Publication:4945502
zbMath0948.52011MaRDI QIDQ4945502
Micha Sharir, Pankaj K. Agarwal
Publication date: 12 November 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Polyhedra and polytopes; regular figures, division of spaces (51M20) Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Artificial intelligence for robotics (68T40)
Related Items
On the arrangement of stochastic lines in \(\mathbb{R}^2\) ⋮ On pseudo-disk hypergraphs ⋮ New variants of perfect non-crossing matchings ⋮ Nondegenerate spheres in four dimensions ⋮ (Approximate) uncertain skylines ⋮ Convex hulls under uncertainty ⋮ Nearest-neighbor searching under uncertainty. I ⋮ Decomposing arrangements of hyperplanes: VC-dimension, combinatorial dimension, and point location ⋮ A generic and flexible framework for the geometrical and topological analysis of (algebraic) surfaces ⋮ Arrangements on parametric surfaces. I: General framework and infrastructure ⋮ Arrangements on parametric surfaces. II: Concretizations and applications ⋮ Querying two boundary points for shortest paths in a polygonal domain ⋮ Monochromatic partitioning of colored points by lines ⋮ Near-linear approximation algorithms for geometric hitting sets ⋮ Convex hulls of spheres and convex hulls of disjoint convex polytopes ⋮ Dense point sets with many halving lines ⋮ Stabbing Convex Polygons with a Segment or a Polygon ⋮ Finding the topology of implicitly defined two algebraic plane curves ⋮ New variants of perfect non-crossing matchings ⋮ Solving the geometric firefighter routing problem via integer programming ⋮ Exact, robust, and efficient regularized Booleans on general 3D meshes ⋮ Minimum vertex cover in rectangle graphs ⋮ A Subdivision Method for Arrangement Computation of Semi-Algebraic Curves ⋮ Exact, efficient, and complete arrangement computation for cubic curves ⋮ Polygon decomposition for efficient construction of Minkowski sums ⋮ Polyhedral circuits and their applications ⋮ Topology and arrangement computation of semi-algebraic planar curves ⋮ On the number of topological types occurring in a parameterized family of arrangements ⋮ Unnamed Item ⋮ On overlays and minimization diagrams ⋮ Point set stratification and Delaunay depth ⋮ Robust shape fitting via peeling and grating coresets ⋮ Discovering cis-regulatory modules by optimizing barbecues ⋮ Crossing patterns of semi-algebraic sets ⋮ An exact and efficient approach for computing a cell in an arrangement of quadrics ⋮ Fast segment insertion and incremental construction of constrained Delaunay triangulations ⋮ Planar location problems with block distance and barriers
