Given a convex lattice polygon, we compute a descending sequence of lattice polygons obtained by repeatedly passing to the convex hull of the interior lattice points. This process gives the idea for an algorithm that simplifies a given parametric surface by reparametrization.
β¦ LIBER β¦
Moving Out the Edges of a Lattice Polygon
β Scribed by Wouter Castryck
- Publisher
- Springer
- Year
- 2011
- Tongue
- English
- Weight
- 800 KB
- Volume
- 47
- Category
- Article
- ISSN
- 0179-5376
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Simplification of surface parametrizatio
β
Josef Schicho
π
Article
π
2003
π
Elsevier Science
π
English
β 211 KB
Maintaining visibility of a polygon with
β
Danny Z. Chen; Ovidiu Daescu
π
Article
π
1998
π
Elsevier Science
π
English
β 763 KB
A bijection for triangulations of a poly
β
Dominique Poulalhon; Gilles Schaeffer
π
Article
π
2003
π
Elsevier Science
π
English
β 368 KB
Loopless triangulations of a polygon with k vertices in k + 2n triangles (with interior points and possibly multiple edges) were enumerated by Mullin in 1965, using generating functions and calculations with the quadratic method. In this article we propose a simple bijective interpretation of Mulli
On the area of square lattice polygons
β
I. G. Enting; A. J. Guttmann
π
Article
π
1990
π
Springer
π
English
β 478 KB
Transverse vibrations of a polygonal pla
β
R.H. GutiΓ©rrez; P.A.A. Laura
π
Article
π
1982
π
Elsevier Science
π
English
β 186 KB
On Finding The Limit Shape Of Optimal Co
β
MiloΕ‘ StojakoviΔ
π
Article
π
2001
π
Elsevier Science
π
English
β 163 KB