Pages that link to "Item:Q917017"

The following pages link to Combinatorial complexity bounds for arrangements of curves and spheres (Q917017):

Displaying 50 items.

• On the Zarankiewicz problem for intersection hypergraphs (Q272311) (← links)
• The Szemerédi-Trotter theorem in the complex plane (Q276440) (← links)
• A note on visibility-constrained Voronoi diagrams (Q400517) (← links)
• On totally positive matrices and geometric incidences (Q458293) (← links)
• On the Erdős distinct distances problem in the plane (Q482909) (← links)
• Highly incidental patterns on a quadratic hypersurface in \(\mathbb{R}^4\) (Q507475) (← links)
• Incidences between points and lines in \({\mathbb {R}}^4\) (Q527445) (← links)
• The complexity and construction of many faces in arrangements of lines and of segments (Q582900) (← links)
• The complexity of many cells in arrangements of planes and related problems (Q582901) (← links)
• An improved bound on the number of unit area triangles (Q603876) (← links)
• The number of unit distances is almost linear for most norms (Q624331) (← links)
• The grid revisited (Q686463) (← links)
• Simple proofs of classical theorems in discrete geometry via the Guth-Katz polynomial partitioning technique (Q714991) (← links)
• Point-curve incidences in the complex plane (Q722326) (← links)
• Incidences with curves in \(\mathbb{R}^d\) (Q727188) (← links)
• A Szemerédi-Trotter type theorem in \(\mathbb R^4\) (Q745661) (← links)
• Variations on the theme of repeated distances (Q756139) (← links)
• Stability versus speed in a computable algebraic model (Q817853) (← links)
• On the diameter of separated point sets with many nearly equal distances (Q850083) (← links)
• Partitioning arrangements of lines. II: Applications (Q921915) (← links)
• Near optimal bounds for the Erdős distinct distances problem in high dimensions (Q949786) (← links)
• Unit distances and diameters in Euclidean spaces (Q1006401) (← links)
• Extremal problems on triangle areas in two and three dimensions (Q1040833) (← links)
• On distinct distances among points in general position and other related problems (Q1046803) (← links)
• Bounding the number of \(k\)-faces in arrangements of hyperplanes (Q1175787) (← links)
• Euclidean minimum spanning trees and bichromatic closest pairs (Q1176318) (← links)
• On disjoint concave chains in arrangements of (pseudo) lines (Q1183468) (← links)
• Almost tight bounds for \(\epsilon\)-nets (Q1184160) (← links)
• Arrangements of curves in the plane --- topology, combinatorics, and algorithms (Q1185003) (← links)
• Repeated angles in the plane and related problems (Q1185877) (← links)
• Counting facets and incidences (Q1189286) (← links)
• The maximum number of second smallest distances in finite planar sets (Q1189287) (← links)
• Applications of random sampling to on-line algorithms in computational geometry (Q1192610) (← links)
• Counting and cutting cycles of lines and rods in space (Q1194306) (← links)
• Improved combinatorial bounds and efficient techniques for certain motion planning problems with three degrees of freedom (Q1194309) (← links)
• Applications of a new space-partitioning technique (Q1196362) (← links)
• The number of edges of many faces in a line segment arrangement (Q1200271) (← links)
• Relative neighborhood graphs in three dimensions (Q1200909) (← links)
• Quasi-optimal upper bounds for simplex range searching and new zone theorems (Q1201746) (← links)
• On the general motion-planning problem with two degrees of freedom (Q1262130) (← links)
• Implicitly representing arrangements of lines or segments (Q1263966) (← links)
• Graphs drawn with few crossings per edge (Q1272189) (← links)
• Spheres, molecules, and hidden surface removal (Q1272310) (← links)
• Cardinalities of \(k\)-distance sets in Minkowski spaces (Q1292877) (← links)
• Popular distances in 3-space (Q1301635) (← links)
• On the sum of squares of cell complexities in hyperplane arrangements (Q1320395) (← links)
• On joints in arrangements of lines in space and related problems (Q1331145) (← links)
• Many-face complexity in incremental convex arrangements (Q1336754) (← links)
• New bounds for lower envelopes in three dimensions, with applications to visibility in terrains (Q1338959) (← links)
• Almost tight upper bounds for lower envelopes in higher dimensions (Q1338960) (← links)