Constructing Arrangements of Lines and Hyperplanes with Applications
From MaRDI portal
(Redirected from Publication:3740283)
Recommendations
Cited in
(only showing first 100 items - show all)- Topological sweep of the complete graph
- A combinatorial geometrical approach to two-dimensional robust pattern matching with scaling and rotation
- Constructing the visibility graph for n-line segments in \(O(n^ 2)\) time
- The power of geometric duality revisited
- Halfspace range search: An algorithmic application of k-sets
- The complexity of cells in three-dimensional arrangements
- Voronoi diagrams and arrangements
- The power of geometric duality
- Visibility of disjoint polygons
- Edge-skeletons in arrangements with applications
- Polygonizations of point sets in the plane
- Recognising polytopical cell complexes and constructing projection polyhedra
- Lower bounds on moving a ladder in two and three dimensions
- Line arrangements and range search
- Verifiable implementations of geometric algorithms using finite precision arithmetic
- Topologically sweeping an arrangement
- Combinatorial face enumeration in arrangements and oriented matroids
- Bounding the number of k-faces in arrangements of hyperplanes
- The complexity of point configurations
- Cutting hyperplane arrangements
- Counting k-subsets and convex k-gons in the plane
- Arrangements of curves in the plane --- topology, combinatorics, and algorithms
- Finding minimum area \(k\)-gons
- The farthest point Delaunay triangulation minimizes angles
- Counting convex \(k\)-gons in planar point sets
- A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
- The number of edges of many faces in a line segment arrangement
- Geometric medians
- Cutting hyperplanes for divide-and-conquer
- Implicitly representing arrangements of lines or segments
- Median hyperplanes in normed spaces -- a survey
- Locating lines and hyperplanes. Theory and algorithms
- Stabbing information of a simple polygon
- Visibility with a moving point of view
- Iterated nearest neighbors and finding minimal polytopes
- A note on hyperplane generation
- Vapnik-Chervonenkis dimension and (pseudo-)hyperplane arrangements
- Better lower bounds on detecting affine and spherical degeneracies
- Erased arrangements of linear and convex decompositions of polyhedra
- Illumination by floodlights
- Finding constrained and weighted Voronoi diagrams in the plane
- Sorting weighted distances with applications to objective function evaluations in single facility location problems.
- Identification of points using disks
- Computing solutions of the multiclass network equilibrium problem with affine cost functions
- Solving the fixed rank convex quadratic maximization in binary variables by a parallel zonotope construction algorithm
- Constructing arrangements optimally in parallel
- Representing geometric structures in \(d\) dimensions: Topology and order
- On vertical ray shooting in arrangements
- New lower bounds for Hopcroft's problem
- New applications of random sampling in computational geometry
- Applications of random sampling in computational geometry. II
- Probing the arrangement of hyperplanes
- Robot motion planning and the single cell problem in arrangements
- Point set pattern matching in \(d\)-dimensions
- Optimal separable partitioning in the plane
- Parallel algorithms for arrangements
- Computing half-plane and strip discrepancy of planar point sets
- Point location in zones of \(k\)-flats in arrangements
- Shadow-boundaries of convex bodies
- Largest and smallest area triangles on imprecise points
- Polyhedral circuits and their applications
- A new polynomially solvable class of quadratic optimization problems with box constraints
- On the restricted k-Steiner tree problem
- The maximum-level vertex in an arrangement of lines
- Computing Shapley values in the plane
- Who witnesses The Witness? Finding witnesses in The Witness is hard and sometimes impossible
- From crossing-free graphs on wheel sets to embracing simplices and polytopes with few vertices
- The generic combinatorial algorithm for image matching with classes of projective transformations
- Zone theorem for arrangements in dimension three
- Finding all pure strategy Nash equilibria in a planar location game
- The \(k\)-nearest-neighbor Voronoi diagram revisited
- Covering grids and orthogonal polygons with periscope guards
- A semidynamic construction of higher-order Voronoi diagrams and its randomized analysis
- Ray shooting on triangles in 3-space
- Orthogonal weightet linear \(L_ 1\) and \(L_ \infty\) approximation and applications
- The use of edge-directions and linear programming to enumerate vertices
- The partition bargaining problem
- On the gap between the quadratic integer programming problem and its semidefinite relaxation
- Corrigendum: Topologically sweeping an arrangement
- Triangles in space or building (and analyzing) castles in the air
- A fast planar partition algorithm. I
- A local analysis to determine all optimal solutions of \(p\)-\(k\)-\(\max\) location problems on networks
- Complexity of training ReLU neural network
- On rainbow quadrilaterals in colored point sets
- Sparse PCA on fixed-rank matrices
- An approximation algorithm for least median of squares regression
- Line arrangements modeling curves of high degree: equations, syzygies and secants
- Solving some vector subset problems by Voronoi diagrams
- Computing nice projections of convex polyhedra
- INDUCING POLYGONS OF LINE ARRANGEMENTS
- Straight skeletons and mitered offsets of nonconvex polytopes
- Spanning trees with low crossing number
- Two-Dimensional Pattern Matching with Combined Scaling and Rotation
- On the Number of Tetrahedra with Minimum, Unit, and Distinct Volumes in Three-Space
- Witness Gabriel graphs
- Combinatorial Bounds and Algorithmic Aspects of Image Matching under Projective Transformations
- Shape Matching by Random Sampling
- New Complexity Bounds for Image Matching under Rotation and Scaling
- scientific article; zbMATH DE number 3907241 (Why is no real title available?)
- scientific article; zbMATH DE number 3915641 (Why is no real title available?)
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)
