Covering n-Segment Unit Arcs Is Not Sufficient
- 期刊名称Discrete and Computational Geometry
- 作者Chatchawan Panraksa; John E. Wetzel; Wacharin Wichiramala
- 卷第37卷
- 期第2期
- 印刷ISSN0179-5376
- 电子ISSN1432-0444
- 文件大小126.68KB
- 发表时间2007-02
- DOI10.1007/s00454-006-1258-7
- 页码297-299
Two poset polytopesRichard P. Stanley · Discrete and Computational Geometry · 1986
Voronoi diagrams and arrangementsHerbert Edelsbrunner; Raimund Seidel · Discrete and Computational Geometry · 1986
Can you cover your shadows?H. E. Debrunner; P. Mani-Levitska · Discrete and Computational Geometry · 1986
Computing circular separabilityJoseph O'Rourke; S. Rao Kosaraju; Nimrod Megiddo · Discrete and Computational Geometry · 1986
Smooth, easy to compute interpolating splinesJohn D. Hobby · Discrete and Computational Geometry · 1986
On polyhedra with transitivity propertiesJ. M. Wills · Discrete and Computational Geometry · 1986
Approximation of convex discs by polygonsA. Florian · Discrete and Computational Geometry · 1986
Diameter partitioningDavid Avis · Discrete and Computational Geometry · 1986