scientific article; zbMATH DE number 1424290
From MaRDI portal
Publication:4945502
Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) Polyhedra and polytopes; regular figures, division of spaces (51M20) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35) Artificial intelligence for robotics (68T40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)
Recommendations
Cited in
(64)- On the number of topological types occurring in a parameterized family of arrangements
- On overlays and minimization diagrams
- Point set stratification and Delaunay depth
- Discovering cis-regulatory modules by optimizing barbecues
- The complexity of cells in three-dimensional arrangements
- Edge-skeletons in arrangements with applications
- S-arrangements with repetitions
- Solving the geometric firefighter routing problem via integer programming
- Convex hulls of spheres and convex hulls of disjoint convex polytopes
- Exact, robust, and efficient regularized Booleans on general 3D meshes
- Polyhedral circuits and their applications
- Nondegenerate spheres in four dimensions
- Decomposing arrangements of hyperplanes: VC-dimension, combinatorial dimension, and point location
- Dense point sets with many halving lines
- Geometry and topology of symmetric point arrangements
- Fast segment insertion and incremental construction of constrained Delaunay triangulations
- On the arrangement of stochastic lines in \(\mathbb{R}^2\)
- Nearest-neighbor searching under uncertainty. I
- Near-linear approximation algorithms for geometric hitting sets
- Exact, efficient, and complete arrangement computation for cubic curves
- Crossing patterns of semi-algebraic sets
- An exact and efficient approach for computing a cell in an arrangement of quadrics
- Stabbing Convex Polygons with a Segment or a Polygon
- (Approximate) uncertain skylines
- Visualizing and exploring planar algebraic arrangements
- scientific article; zbMATH DE number 4060713 (Why is no real title available?)
- scientific article; zbMATH DE number 49092 (Why is no real title available?)
- scientific article; zbMATH DE number 66688 (Why is no real title available?)
- Querying two boundary points for shortest paths in a polygonal domain
- scientific article; zbMATH DE number 1241850 (Why is no real title available?)
- Proximity in Arrangements of Algebraic Sets
- Combinatorial Properties of One-Dimensional Arrangements
- scientific article; zbMATH DE number 1182914 (Why is no real title available?)
- Improved construction of vertical decompositions of three-dimensional arrangements
- Finding the topology of implicitly defined two algebraic plane curves
- Hyperplane arrangements in \texttt{polymake}
- Arrangements in higher dimensions: Voronoi diagrams, motion planning, and other applications
- Kernelization of the subset general position problem in geometry
- A subdivision method for arrangement computation of semi-algebraic curves
- Arrangements
- Efficient and small representation of line arrangements with applications
- Description of the connected components of arrangements
- Minimum vertex cover in rectangle graphs
- scientific article; zbMATH DE number 2242531 (Why is no real title available?)
- Robust shape fitting via peeling and grating coresets
- Sweeps, arrangements and signotopes
- Polygon decomposition for efficient construction of Minkowski sums
- Monochromatic partitioning of colored points by lines
- New variants of perfect non-crossing matchings
- A generic and flexible framework for the geometrical and topological analysis of (algebraic) surfaces
- CGAL Arrangements and their applications. A step-by-step guide
- Arrangements on parametric surfaces. I: General framework and infrastructure
- Arrangements on parametric surfaces. II: Concretizations and applications
- Unbounded regions of high-order Voronoi diagrams of lines and line segments in higher dimensions
- Computing data distribution from query selectivities
- Betti numbers of random hypersurface arrangements
- Hopcroft's problem, log* shaving, two-dimensional fractional cascading, and decision trees
- On the computation of an arrangement of quadrics in 3D
- Optimal motion planning for two square robots in a rectilinear environment
- Topology and arrangement computation of semi-algebraic planar curves
- Finding a maximum clique in a disk graph
- Planar location problems with block distance and barriers
- On pseudo-disk hypergraphs
- New variants of perfect non-crossing matchings
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4945502)
