scientific article; zbMATH DE number 4032498
From MaRDI portal
Publication:3772828
algorithms in computational geometryarrangements of hyperplanes in Euclidean spacescombinatorial geometryRadon theoremsearching Helly theoremsortingtime-complexityVoronoi diagrams
Exact enumeration problems, generating functions (05A15) Other designs, configurations (05B30) Research exposition (monographs, survey articles) pertaining to convex and discrete geometry (52-02) Helly-type theorems and geometric transversal theory (52A35) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Searching and sorting (68P10) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)
Recommendations
Cited in
(only showing first 100 items - show all)- Depth of segments and circles through points enclosing many points: A note
- A fast algorithm for the alpha-connected two-center decision problem
- On regular vertices of the union of planar convex objects
- A practical approximation algorithm for the LMS line estimator
- Point set stratification and Delaunay depth
- Dynamic ham-sandwich cuts in the plane
- The analysis and the representation of balanced complex polytopes in 2D
- A combinatorial geometrical approach to two-dimensional robust pattern matching with scaling and rotation
- New results on lower bounds for the number of \((\leq k)\)-facets
- Smallest \(k\)-point enclosing rectangle and square of arbitrary orientation
- The power of geometric duality
- -nets and simplex range queries
- Edge-skeletons in arrangements with applications
- Minimum polygonal separation
- The complexity of cutting complexes
- An algorithmic approach to some problems in terrain navigation
- Topologically sweeping an arrangement
- Submodularity and the traveling salesman problem
- Decomposing trimmed surfaces using the Voronoï diagram and a scan line algorithm
- Mathematical snapshots from the computational geometry landscape
- Compaction and separation algorithms for non-convex polygons and their applications
- Parallel computation of distance transforms
- Bounding the number of k-faces in arrangements of hyperplanes
- The complexity of point configurations
- Cutting hyperplane arrangements
- Euclidean minimum spanning trees and bichromatic closest pairs
- Small-dimensional linear programming and convex hulls made easy
- Points and triangles in the plane and halving planes in space
- A singly exponential stratification scheme for real semi-algebraic varieties and its applications
- Bisections and ham-sandwich cuts of convex polygons and polyhedra
- A role of lower semicontinuous functions in the combinatorial complexity of geometric problems
- On \(k\)-sets in arrangements of curves and surfaces
- A basis enumeration algorithm for linear systems with geometric applications
- Improved complexity bounds for location problems on the real line
- Randomized optimal algorithm for slope selection
- Satisfying general proximity/similarity queries with metric trees
- On disjoint concave chains in arrangements of (pseudo) lines
- An upper bound on the number of planar K-sets
- Almost tight bounds for -nets
- Tiling polygons with parallelograms
- Arrangements of curves in the plane --- topology, combinatorics, and algorithms
- Randomized incremental construction of Delaunay and Voronoi diagrams
- Finding minimum area \(k\)-gons
- How to find Steiner minimal trees in Euclidean \(d\)-space
- Optimal parallel algorithms for point-set and polygon problems
- Counting facets and incidences
- A new representation and algorithm for constructing convex hulls in higher dimensional spaces
- Applications of random sampling to on-line algorithms in computational geometry
- Finding stabbing lines in 3-space
- Counting and cutting cycles of lines and rods in space
- Improved combinatorial bounds and efficient techniques for certain motion planning problems with three degrees of freedom
- Farthest neighbors, maximum spanning trees and related problems in higher dimensions
- Delaunay triangulations in three dimensions with finite precision arithmetic
- The convergence rate of the sandwich algorithm for approximating convex functions
- Reporting points in halfspaces
- Intersection queries in sets of disks
- Fast algorithms for greedy triangulation
- Optimal time bounds for some proximity problems in the plane
- Decision theoretic generalizations of the PAC model for neural net and other learning applications
- Transitions in geometric minimum spanning trees
- A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
- Efficient partition trees
- Solving the Euclidean bottleneck biconnected edge subgraph problem by 2- relative neighborhood graphs
- Upper envelope onion peeling
- Minimizing the sum of diameters efficiently
- The colored Tverberg's problem and complexes of injective functions
- On computing the exact value of dispersion of a sequence
- Hamiltonian triangulations and circumscribing polygons of disjoint line segments
- Convexity preserving interpolation and Powell-Sabin elements
- Geometric medians
- Quasi-optimal upper bounds for simplex range searching and new zone theorems
- Parallel methods for visibility and shortest-path problems in simple polygons
- Axioms and hulls
- Stacks, queues, and deques with order-statistic operations
- The slab dividing approach to solve the Euclidean \(P\)-center problem
- The upper envelope of Voronoi surfaces and its applications
- Interval probability propagation
- Degree constrained tree embedding into points in the plane
- Cutting hyperplanes for divide-and-conquer
- On the zone of a surface in a hyperplane arrangement
- On the randomized construction of the Delaunay tree
- An efficient algorithm for finding the CSG representation of a simple polygon
- On arrangements of Jordan arcs with three intersections per pair
- Implicitly representing arrangements of lines or segments
- A computational basis for higher-dimensional computational geometry and applications
- On some geometric selection and optimization problems via sorted matrices
- Isolating points by lines in the plane
- Finding minimum area simple pentagons
- The catline for deep regression
- A nearly parallel algorithm for the Voronoi diagram of a convex polygon
- Detecting geometric infeasibility
- The widest k-dense corridor problems
- Guarding galleries where no point sees a small area.
- Noise-tolerant parallel learning of geometric concepts
- Stabbing information of a simple polygon
- Solving restricted line location problems via a dual interpretation
- Halfspace depth and regression depth characterize the empirical distribution
- An approximate algorithm for computing multidimensional convex hulls
- Bipartite embeddings of trees in the plane
- A software package of algorithms and heuristics for disjoint paths in \textit{Pla}nar \textit{Net}works
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 Q3772828)
