Pages that link to "Item:Q3740283"
From MaRDI portal
The following pages link to Constructing Arrangements of Lines and Hyperplanes with Applications (Q3740283):
Displaying 50 items.
- Bounding the number of \(k\)-faces in arrangements of hyperplanes (Q1175787) (← links)
- The complexity of point configurations (Q1175788) (← links)
- Cutting hyperplane arrangements (Q1176317) (← links)
- Counting \(k\)-subsets and convex \(k\)-gons in the plane (Q1178214) (← links)
- Arrangements of curves in the plane --- topology, combinatorics, and algorithms (Q1185003) (← links)
- Finding minimum area \(k\)-gons (Q1186081) (← links)
- The farthest point Delaunay triangulation minimizes angles (Q1188284) (← links)
- Counting convex \(k\)-gons in planar point sets (Q1190511) (← links)
- A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra (Q1199131) (← links)
- The number of edges of many faces in a line segment arrangement (Q1200271) (← links)
- Geometric medians (Q1201233) (← links)
- Implicitly representing arrangements of lines or segments (Q1263966) (← links)
- Median hyperplanes in normed spaces -- a survey (Q1281394) (← links)
- Stabbing information of a simple polygon (Q1283786) (← links)
- Visibility with a moving point of view (Q1322569) (← links)
- Iterated nearest neighbors and finding minimal polytopes (Q1327455) (← links)
- Better lower bounds on detecting affine and spherical degeneracies (Q1346125) (← links)
- Erased arrangements of linear and convex decompositions of polyhedra (Q1384196) (← links)
- Illumination by floodlights (Q1388133) (← links)
- Finding constrained and weighted Voronoi diagrams in the plane (Q1388136) (← links)
- Sorting weighted distances with applications to objective function evaluations in single facility location problems. (Q1426729) (← links)
- Identification of points using disks (Q1618247) (← links)
- Computing solutions of the multiclass network equilibrium problem with affine cost functions (Q1730728) (← links)
- Solving the fixed rank convex quadratic maximization in binary variables by a parallel zonotope construction algorithm (Q1779531) (← links)
- Constructing arrangements optimally in parallel (Q1802221) (← links)
- Representing geometric structures in \(d\) dimensions: Topology and order (Q1802222) (← links)
- New applications of random sampling in computational geometry (Q1820582) (← links)
- Applications of random sampling in computational geometry. II (Q1823685) (← links)
- Robot motion planning and the single cell problem in arrangements (Q1842755) (← links)
- Point set pattern matching in \(d\)-dimensions (Q1891233) (← links)
- Optimal separable partitioning in the plane (Q1893156) (← links)
- Parallel algorithms for arrangements (Q1907232) (← links)
- Computing half-plane and strip discrepancy of planar point sets (Q1917044) (← links)
- Point location in zones of \(k\)-flats in arrangements (Q1917049) (← links)
- Shadow-boundaries of convex bodies (Q1923492) (← links)
- Largest and smallest area triangles on imprecise points (Q1984599) (← links)
- Polyhedral circuits and their applications (Q2039640) (← links)
- A new polynomially solvable class of quadratic optimization problems with box constraints (Q2047220) (← links)
- On the restricted \(k\)-Steiner tree problem (Q2084651) (← links)
- Computing Shapley values in the plane (Q2118220) (← links)
- Who witnesses The Witness? Finding witnesses in The Witness is hard and sometimes impossible (Q2196563) (← links)
- On colouring point visibility graphs (Q2201772) (← links)
- From crossing-free graphs on wheel sets to embracing simplices and polytopes with few vertices (Q2207612) (← links)
- The generic combinatorial algorithm for image matching with classes of projective transformations (Q2216108) (← links)
- Zone theorem for arrangements in dimension three (Q2234787) (← links)
- Finding all pure strategy Nash equilibria in a planar location game (Q2275630) (← links)
- Some results on point visibility graphs (Q2339447) (← links)
- The \(k\)-nearest-neighbor Voronoi diagram revisited (Q2346966) (← links)
- Covering grids and orthogonal polygons with periscope guards (Q2365810) (← links)
- A semidynamic construction of higher-order Voronoi diagrams and its randomized analysis (Q2366225) (← links)
