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 complexity of order type isomorphism
- Zone theorem for arrangements in dimension three
- Computing solutions of the multiclass network equilibrium problem with affine cost functions
- Minimal Representations of Order Types by Geometric Graphs
- Computing unique three-dimensional object aspects representation
- Polyhedral circuits and their applications
- On rainbow quadrilaterals in colored point sets
- Reporting the crossing-free segments of a complete geometric graph
- Kernelization of the subset general position problem in geometry
- The maximum-level vertex in an arrangement of lines
- Computing Shapley values in the plane
- An optimal algorithm for reconstructing point set order types from radial orderings
- The edge labeling of higher order Voronoi diagrams
- Computing half-plane and strip discrepancy of planar point sets
- Point location in zones of \(k\)-flats in arrangements
- Maintaining proximity in higher dimensional spaces (extended abstract)
- Who witnesses The Witness? Finding witnesses in The Witness is hard and sometimes impossible
- On the restricted \(k\)-Steiner tree problem
- From crossing-free graphs on wheel sets to embracing simplices and polytopes with few vertices
- Complexity and algorithms for finding a subset of vectors with the longest sum
- Approximating finite weighted point sets by hyperplanes
- Convex polygons made from few lines and convex decompositions of polyhedra
- Efficient geometric algorithms for workpiece orientation in 4- and 5-axis NC-machining
- Constructing arrangements optimally in parallel
- scientific article; zbMATH DE number 3907241 (Why is no real title available?)
- Sparse PCA on fixed-rank matrices
- Approximating length-restricted means under dynamic time warping
- Probing the arrangement of hyperplanes
- Computing a flattest, undercut-free parting line for a convex polyhedron, with application to mold design
- On finding ordinary or monochromatic intersection points
- Solving some vector subset problems by Voronoi diagrams
- Line arrangements modeling curves of high degree: equations, syzygies and secants
- Improved bounds for 3SUM, \(k\)-SUM, and linear degeneracy
- An exact algorithm for finding a vector subset with the longest sum
- scientific article; zbMATH DE number 2209725 (Why is no real title available?)
- A New Algorithm for Enumeration of Cells of Hyperplane Arrangements and a Comparison with Avis and Fukuda's Reverse Search
- The generic combinatorial algorithm for image matching with classes of projective transformations
- scientific article; zbMATH DE number 3915641 (Why is no real title available?)
- Complexity of training ReLU neural network
- A normal fan projection algorithm for low-rank optimization
- scientific article; zbMATH DE number 7370561 (Why is no real title available?)
- 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
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)
