Pages that link to "Item:Q1924712"
From MaRDI portal
The following pages link to Generating random polygons with given vertices (Q1924712):
Displaying 19 items.
- Reconstructing polygons from scanner data (Q553352) (← links)
- Computing simple paths from given points inside a polygon (Q1630775) (← links)
- On local transformation of polygons with visibility properties. (Q1853571) (← links)
- Connecting polygonizations via stretches and twangs (Q1959392) (← links)
- Algorithmic enumeration of surrounding polygons (Q1983143) (← links)
- An exact algorithm for constructing minimum Euclidean skeletons of polygons (Q2131144) (← links)
- Optimal area polygonization problems: exact solutions through geometric duality (Q2147134) (← links)
- Generation of random digital simple curves with artistic emulation (Q2251203) (← links)
- Counting triangulations and other crossing-free structures via onion layers (Q2351010) (← links)
- On planar path transformation (Q2379998) (← links)
- Use of simple polygonal chains in generating random simple polygons (Q2400166) (← links)
- On the Enumeration of Permutominoes (Q2947868) (← links)
- An experimental study of the stability problem in discrete tomography (Q3438902) (← links)
- ON 2D SOLID α-COMPLEXES OF POISSON DISC SAMPLINGS (Q4923357) (← links)
- 2-Opt Moves and Flips for Area-optimal Polygonizations (Q5102068) (← links)
- Area-Optimal Simple Polygonalizations: The CG Challenge 2019 (Q5102073) (← links)
- An Empirical Study on Randomized Optimal Area Polygonization of Planar Point Sets (Q5266598) (← links)
- Computing Simple Paths on Points in Simple Polygons (Q5302737) (← links)
- Simplifying obstacles for Steiner network problems in the plane (Q6087564) (← links)
