Constructing Arrangements of Lines and Hyperplanes with Applications
From MaRDI portal
Publication:3740283
Recommendations
Cited in
(only showing first 100 items - show all)- Vapnik-Chervonenkis dimension and (pseudo-)hyperplane arrangements
- Illumination by floodlights
- Geometric medians
- On the Number of Tetrahedra with Minimum, Unit, and Distinct Volumes in Three-Space
- Robot motion planning and the single cell problem in arrangements
- Deciding robust feasibility and infeasibility using a set containment approach: an application to stationary passive gas network operations
- WALKING IN AN ARRANGEMENT TOPOLOGICALLY
- A note on hyperplane generation
- TOPOLOGICAL PEELING AND APPLICATIONS
- Computing a sweeping-plane in regular (``general) position: A numerical and a symbolic solution
- INDUCING POLYGONS OF LINE ARRANGEMENTS
- Counting convex \(k\)-gons in planar point sets
- An optimal algorithm for the boundary of a cell in a union of rays
- A dual approach to detect polyhedral intersections in arbitrary dimensions
- A linear optimization oracle for zonotope computation
- Largest and smallest area triangles on imprecise points
- A tail estimate for Mulmuley's segment intersection algorithm
- Output-sensitive cell enumeration in hyperplane arrangements
- Reaching a goal with directional uncertainty
- The partition bargaining problem
- Subset selection in sparse matrices
- A local analysis to determine all optimal solutions of \(p\)-\(k\)-\(\max\) location problems on networks
- New Complexity Bounds for Image Matching under Rotation and Scaling
- Geometric matching algorithms for two realistic terrains
- Algorithms for high dimensional stabbing problems
- A theorem on the average number of subfaces in arrangements and oriented matroids
- Edge-skeletons in arrangements with applications
- On levels in arrangements and Voronoi diagrams
- Polygonizations of point sets in the plane
- Erased arrangements of linear and convex decompositions of polyhedra
- Recognising polytopical cell complexes and constructing projection polyhedra
- Shadow-boundaries of convex bodies
- Identification of points using disks
- Finding points in general position
- Lower bounds on moving a ladder in two and three dimensions
- Line arrangements and range search
- Probing a set of hyperplanes by lines and related problems
- Efficient algorithms for maximum regression depth
- On vertical ray shooting in arrangements
- Parallel algorithms for arrangements
- Computing nice projections of convex polyhedra
- Bounding the number of \(k\)-faces in arrangements of hyperplanes
- The number of edges of many faces in a line segment arrangement
- Capturing crossings: convex hulls of segment and plane intersections
- Stabbing information of a simple polygon
- Covering grids and orthogonal polygons with periscope guards
- Optimal separable partitioning in the plane
- Shape Matching by Random Sampling
- The farthest point Delaunay triangulation minimizes angles
- Orthogonal weightet linear \(L_ 1\) and \(L_ \infty\) approximation and applications
- Implicitly representing arrangements of lines or segments
- Finding constrained and weighted Voronoi diagrams in the plane
- Spanning trees with low crossing number
- Ray shooting on triangles in 3-space
- Corrigendum: Topologically sweeping an arrangement
- Finding all pure strategy Nash equilibria in a planar location game
- On counting pairs of intersecting segments and off-line triangle range searching
- Algorithms for weak and wide separation of sets
- New bounds on the unconstrained quadratic integer programming problem
- A fast planar partition algorithm. I
- scientific article; zbMATH DE number 4032498 (Why is no real title available?)
- Applications of random sampling in computational geometry. II
- New applications of random sampling in computational geometry
- The use of edge-directions and linear programming to enumerate vertices
- Computing optimal islands
- Combinatorial face enumeration in arrangements and oriented matroids
- Median hyperplanes in normed spaces -- a survey
- The complexity and construction of many faces in arrangements of lines and of segments
- A semidynamic construction of higher-order Voronoi diagrams and its randomized analysis
- A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
- Approximation algorithms for free-label maximization
- PROPERTIES OF ARRANGEMENT GRAPHS
- Algorithms for marketing-mix optimization
- Hamiltonicity and colorings of arrangement graphs
- A combinatorial geometrical approach to two-dimensional robust pattern matching with scaling and rotation
- All-maximum and all-minimum problems under some measures
- The complexity of many cells in arrangements of planes and related problems
- Arrangements of curves in the plane --- topology, combinatorics, and algorithms
- Shape matching by random sampling
- Voronoi diagrams and arrangements
- Witness Gabriel graphs
- Partitioning arrangements of lines. I: An efficient deterministic algorithm
- A new duality result concerning Voronoi diagrams
- Combinatorial Bounds and Algorithmic Aspects of Image Matching under Projective Transformations
- The \(k\)-nearest-neighbor Voronoi diagram revisited
- Topological sweep of the complete graph
- A deterministic view of random sampling and its use in geometry
- Partitioning arrangements of lines. II: Applications
- Two-Dimensional Pattern Matching with Combined Scaling and Rotation
- CGAL Arrangements and their applications. A step-by-step guide
- Algorithms for deciding the containment of polygons
- Constructing Belts in Two-Dimensional Arrangements with Applications
- The complexity of point configurations
- The complexity of cells in three-dimensional arrangements
- Better lower bounds on detecting affine and spherical degeneracies
- The power of geometric duality
- Locating lines and hyperplanes. Theory and algorithms
- On the gap between the quadratic integer programming problem and its semidefinite relaxation
- Verifiable implementations of geometric algorithms using finite precision arithmetic
- Triangles in space or building (and analyzing) castles in the air
This page was built for publication: Constructing Arrangements of Lines and Hyperplanes with Applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3740283)
