Pages that link to "Item:Q3313273"
From MaRDI portal
The following pages link to A new linear convex hull algorithm for simple polygons (Corresp.) (Q3313273):
Displaying 10 items.
- A linear-time algorithm to compute the triangular hull of a digital object (Q528337) (← links)
- Convex hulls of objects bounded by algebraic curves (Q802894) (← links)
- On-line construction of the convex hull of a simple polyline (Q1107996) (← links)
- Numerical stability of a convex hull algorithm for simple polygons (Q1310463) (← links)
- Optimal computation of finitely oriented convex hulls (Q1820432) (← links)
- Staircase visibility and computation of kernels (Q1894710) (← links)
- Finding a closet visible vertex pair between two polygons (Q1899450) (← links)
- Three problems about simple polygons (Q2432735) (← links)
- COMPUTATIONAL AND STRUCTURAL ADVANTAGES OF CIRCULAR BOUNDARY REPRESENTATION (Q3007723) (← links)
- LATIN 2004: Theoretical Informatics (Q5901636) (← links)