The following pages link to (Q4945520):
Displayed 20 items.
- Diffuse reflection diameter in simple polygons (Q299067) (← links)
- A new upper bound for the VC-dimension of visibility regions (Q390367) (← links)
- An improved algorithm for reconstructing a simple polygon from its visibility angles (Q419377) (← links)
- Watchman tours for polygons with holes (Q419503) (← links)
- Point-set embeddings of plane \(3\)-trees (Q427050) (← links)
- Long non-crossing configurations in the plane (Q603879) (← links)
- Computing pseudotriangulations via branched coverings (Q714984) (← links)
- New variants of perfect non-crossing matchings (Q831710) (← links)
- The embracing Voronoi diagram and closest embracing number (Q844526) (← links)
- Enumerating edge-constrained triangulations and edge-constrained non-crossing geometric spanning trees (Q967420) (← links)
- Segment endpoint visibility graphs are Hamiltonian (Q1395575) (← links)
- Optimal point-set embedding of wheel graphs and a sub-class of 3-trees (Q2396907) (← links)
- Compatible spanning trees (Q2444309) (← links)
- Computing the maximum clique in the visibility graph of a simple polygon (Q2466015) (← links)
- Visibility maps of segments and triangles in 3D (Q2477193) (← links)
- A linear time algorithm to remove winding of a simple polygon (Q2489541) (← links)
- Reconstructing Generalized Staircase Polygons with Uniform Step Length (Q4625103) (← links)
- Reconstructing Generalized Staircase Polygons with Uniform Step Length (Q4961754) (← links)
- Characterizing LR-visibility polygons and related problems (Q5931367) (← links)
- New variants of perfect non-crossing matchings (Q6180638) (← links)