Pages that link to "Item:Q5672661"

The following pages link to Dissection graphs of planar point sets (Q5672661):

Displaying 50 items.

• Exact algorithms for size constrained 2-clustering in the plane (Q288798) (← links)
• On the number of crossing-free partitions (Q359753) (← links)
• On \(\leq k\)-edges, crossings, and halving lines of geometric drawings of \(K _{n }\) (Q443913) (← links)
• On levels in arrangements of surfaces in three dimensions (Q443917) (← links)
• The number of generalized balanced lines (Q603873) (← links)
• Long non-crossing configurations in the plane (Q603879) (← links)
• Ernst G. Straus (1922-1983) (Q800339) (← links)
• On levels in arrangements and Voronoi diagrams (Q804321) (← links)
• On the conjectured upper bounds for entries of mutation count matrices (Q1041608) (← links)
• The number of small semispaces of a finite set of points in the plane (Q1070228) (← links)
• Diameter partitioning (Q1076974) (← links)
• Halfspace range search: An algorithmic application of k-sets (Q1077166) (← links)
• On the intersection of edges of a geometric graph by straight lines (Q1080859) (← links)
• The number of extreme pairs of finite point-sets in Euclidean spaces (Q1087828) (← links)
• Edge-skeletons in arrangements with applications (Q1091825) (← links)
• Line arrangements and range search (Q1107313) (← links)
• The complexity of point configurations (Q1175788) (← links)
• Points and triangles in the plane and halving planes in space (Q1176320) (← links)
• An upper bound on the number of planar \(K\)-sets (Q1184155) (← links)
• On the average number of \(k\)-sets (Q1193707) (← links)
• Median hyperplanes in normed spaces -- a survey (Q1281394) (← links)
• A bound on local minima of arrangements that implies the upper bound theorem (Q1312194) (← links)
• On the expected number of \(k\)-sets (Q1327450) (← links)
• Counting triangle crossings and halving planes (Q1338957) (← links)
• Computing depth contours of bivariate point clouds (Q1350819) (← links)
• Cutting dense point sets in half (Q1355189) (← links)
• An improvement of the lower bound on the maximum number of halving lines in planar sets with 32 points (Q1792119) (← links)
• On the number of line separations of a finite set in the plane (Q1821352) (← links)
• Total polynomials of uniform oriented matroids (Q1964645) (← links)
• On the complexity of the \(k\)-level in arrangements of pseudoplanes (Q2022137) (← links)
• Algebraic \(k\)-sets and generally neighborly embeddings (Q2117359) (← links)
• Dense point sets with many halving lines (Q2207605) (← links)
• Dispersing and grouping points on planar segments (Q2232600) (← links)
• Median spheres: Theory, algorithms, applications (Q2267770) (← links)
• Approximation of the yolk by the LP yolk (Q2270338) (← links)
• On the arrangement of stochastic lines in \(\mathbb{R}^2\) (Q2363351) (← links)
• Algorithms for bivariate zonoid depth (Q2456661) (← links)
• The maximum multiplicity of a generator in a reduced word (Q2680963) (← links)
• The maximum number of halving lines and the rectilinear crossing number of for (Q3503562) (← links)
• Characterizations of graphs having orientations satisfying local degree restrictions (Q4154884) (← links)
• Crossing-Free Perfect Matchings in Wheel Point Sets (Q4604397) (← links)
• A survey of mass partitions (Q5067418) (← links)
• New algorithms and bounds for halving pseudolines (Q5918765) (← links)
• Matching colored points in the plane: Some new results (Q5943323) (← links)
• Entering and leaving \(j\)-facets (Q5944934) (← links)
• On the connectivity of the disjointness graph of segments of point sets in general position in the plane (Q6045406) (← links)
• Improved bounds for the expected number of \(k\)-sets (Q6050223) (← links)
• The edge labeling of higher order Voronoi diagrams (Q6618154) (← links)
• Deep cliques in point sets (Q6624183) (← links)
• Depth in arrangements: Dehn-Sommerville-Euler relations with applications (Q6645901) (← links)