Constructing Arrangements of Lines and Hyperplanes with Applications
From MaRDI portal
Publication:3740283
Recommendations
Cited in
(only showing first 100 items - show all)- Arrangements of curves in the plane --- topology, combinatorics, and algorithms
- A linear optimization oracle for zonotope computation
- scientific article; zbMATH DE number 4032498 (Why is no real title available?)
- All-maximum and all-minimum problems under some measures
- Geometric matching algorithms for two realistic terrains
- A theorem on the average number of subfaces in arrangements and oriented matroids
- New complexity bounds for image matching under rotation and scaling
- Capturing crossings: convex hulls of segment and plane intersections
- Combinatorial face enumeration in arrangements and oriented matroids
- New Complexity Bounds for Image Matching under Rotation and Scaling
- Sorting weighted distances with applications to objective function evaluations in single facility location problems.
- The generic combinatorial algorithm for image matching with classes of projective transformations
- Optimal separable partitioning in the plane
- Probing a set of hyperplanes by lines and related problems
- A New Algorithm for Enumeration of Cells of Hyperplane Arrangements and a Comparison with Avis and Fukuda's Reverse Search
- Cutting hyperplane arrangements
- The number of edges of many faces in a line segment arrangement
- Computing solutions of the multiclass network equilibrium problem with affine cost functions
- Computing nice projections of convex polyhedra
- A semidynamic construction of higher-order Voronoi diagrams and its randomized analysis
- Solving the fixed rank convex quadratic maximization in binary variables by a parallel zonotope construction algorithm
- Output-sensitive cell enumeration in hyperplane arrangements
- Algorithms for marketing-mix optimization
- An exact algorithm for finding a vector subset with the longest sum
- A polynomial-time recursive algorithm for some unconstrained quadratic optimization problems
- Constructing arrangements optimally in parallel
- Bounding the number of k-faces in arrangements of hyperplanes
- Lower bounds on moving a ladder in two and three dimensions
- Line arrangements and range search
- Selecting distances in arrangements of hyperplanes spanned by points.
- TOPOLOGICAL PEELING AND APPLICATIONS
- Approximation algorithms for free-label maximization
- The complexity of point configurations
- POINT AND LINE SEGMENT RECONSTRUCTION FROM VISIBILITY INFORMATION
- The maximum-level vertex in an arrangement of lines
- Computing Shapley values in the plane
- A deterministic view of random sampling and its use in geometry
- A fast planar partition algorithm. I
- Shape Matching by Random Sampling
- INDUCING POLYGONS OF LINE ARRANGEMENTS
- Peeling potatoes near-optimally in near-linear time
- Representing geometric structures in \(d\) dimensions: Topology and order
- The complexity of many cells in arrangements of planes and related problems
- Orthogonal weightet linear \(L_ 1\) and \(L_ \infty\) approximation and applications
- The use of edge-directions and linear programming to enumerate vertices
- Counting \(k\)-subsets and convex \(k\)-gons in the plane
- Computing a flattest, undercut-free parting line for a convex polyhedron, with application to mold design
- Searching for empty convex polygons
- On counting pairs of intersecting segments and off-line triangle range searching
- Complexity and algorithms for finding a subset of vectors with the longest sum
- Zone theorem for arrangements in dimension three
- Voronoi diagrams and arrangements
- Finding constrained and weighted Voronoi diagrams in the plane
- A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
- Finding all pure strategy Nash equilibria in a planar location game
- An approximation algorithm for least median of squares regression
- Combinatorial complexity bounds for arrangements of curves and spheres
- Minimal Representations of Order Types by Geometric Graphs
- On vertical ray shooting in arrangements
- Algorithms for weak and wide separation of sets
- Computing optimal islands
- On the restricted \(k\)-Steiner tree problem
- The power of geometric duality
- Constructing the visibility graph for n-line segments in \(O(n^ 2)\) time
- Identification of points using disks
- Halfspace range search: An algorithmic application of k-sets
- Stabbing information of a simple polygon
- Point set pattern matching in \(d\)-dimensions
- On the gap between the quadratic integer programming problem and its semidefinite relaxation
- Deciding robust feasibility and infeasibility using a set containment approach: an application to stationary passive gas network operations
- scientific article; zbMATH DE number 7370561 (Why is no real title available?)
- Cutting hyperplanes for divide-and-conquer
- The partition bargaining problem
- Combinatorial Bounds and Algorithmic Aspects of Image Matching under Projective Transformations
- Line arrangements modeling curves of high degree: equations, syzygies and secants
- Implicitly representing arrangements of lines or segments
- The complexity and construction of many faces in arrangements of lines and of segments
- Shape matching by random sampling
- Better lower bounds on detecting affine and spherical degeneracies
- scientific article; zbMATH DE number 2209725 (Why is no real title available?)
- An optimal algorithm for reconstructing point set order types from radial orderings
- A new polynomially solvable class of quadratic optimization problems with box constraints
- Finding points in general position
- Applications of random sampling in computational geometry. II
- New applications of random sampling in computational geometry
- The complexity of cells in three-dimensional arrangements
- Efficient algorithms for maximum regression depth
- The edge labeling of higher order Voronoi diagrams
- Hamiltonicity and colorings of arrangement graphs
- Erased arrangements of linear and convex decompositions of polyhedra
- Topologically sweeping an arrangement
- Maintaining proximity in higher dimensional spaces (extended abstract)
- Computing half-plane and strip discrepancy of planar point sets
- Point location in zones of \(k\)-flats in arrangements
- Shadow-boundaries of convex bodies
- The farthest point Delaunay triangulation minimizes angles
- A local analysis to determine all optimal solutions of \(p\)-\(k\)-\(\max\) location problems on networks
- Illumination by floodlights
- Polyhedral circuits and their applications
- Locating lines and hyperplanes. Theory and algorithms
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)
