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.
- 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)
- The maximum-level vertex in an arrangement of lines (Q2117347) (← 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)
- Ray shooting on triangles in 3-space (Q2366231) (← links)
- Orthogonal weightet linear \(L_ 1\) and \(L_ \infty\) approximation and applications (Q2367406) (← links)
- The use of edge-directions and linear programming to enumerate vertices (Q2471066) (← links)
- The partition bargaining problem (Q2473040) (← links)
- On the gap between the quadratic integer programming problem and its semidefinite relaxation (Q2492705) (← links)
- Corrigendum: Topologically sweeping an arrangement (Q2638777) (← links)
- Triangles in space or building (and analyzing) castles in the air (Q2638823) (← links)
- A fast planar partition algorithm. I (Q2638830) (← links)
- A local analysis to determine all optimal solutions of \(p\)-\(k\)-\(\max\) location problems on networks (Q2664012) (← links)
- Complexity of training ReLU neural network (Q2673242) (← links)
- On rainbow quadrilaterals in colored point sets (Q2676756) (← links)
- Sparse PCA on fixed-rank matrices (Q2687042) (← links)
- Line arrangements modeling curves of high degree: equations, syzygies and secants (Q2949168) (← links)
- Solving some vector subset problems by Voronoi diagrams (Q2959192) (← links)
- COMPUTING NICE PROJECTIONS OF CONVEX POLYHEDRA (Q3007724) (← links)
- INDUCING POLYGONS OF LINE ARRANGEMENTS (Q3089096) (← links)
- Spanning trees with low crossing number (Q3358265) (← links)
- Two-Dimensional Pattern Matching with Combined Scaling and Rotation (Q3506938) (← links)
- On the Number of Tetrahedra with Minimum, Unit, and Distinct Volumes in Three-Space (Q3512600) (← links)
- Combinatorial Bounds and Algorithmic Aspects of Image Matching under Projective Transformations (Q3599144) (← links)
- Shape Matching by Random Sampling (Q3605513) (← links)
- New Complexity Bounds for Image Matching under Rotation and Scaling (Q3637109) (← links)
- Reporting the crossing-free segments of a complete geometric graph (Q4332449) (← links)
- Constructing Levels in Arrangements and Higher Order Voronoi Diagrams (Q4388891) (← links)
- Finding Points in General Position (Q4605338) (← links)
- A New Algorithm for Enumeration of Cells of Hyperplane Arrangements and a Comparison with Avis and Fukuda's Reverse Search (Q4605440) (← links)
- PROPERTIES OF ARRANGEMENT GRAPHS (Q4661879) (← links)
- POINT AND LINE SEGMENT RECONSTRUCTION FROM VISIBILITY INFORMATION (Q4682195) (← links)
- TOPOLOGICAL PEELING AND APPLICATIONS (Q4818578) (← links)
- Subset Selection in Sparse Matrices (Q4961001) (← links)
- (Q4998935) (← links)
- Output-sensitive cell enumeration in hyperplane arrangements (Q5054865) (← links)
- Approximating finite weighted point sets by hyperplanes (Q5056110) (← links)
