Logo

Login

On Computing and Drawing Maxmin-Height Covering Triangulation

Zhu, Binhai and Deng, Xiaotie (1998) On Computing and Drawing Maxmin-Height Covering Triangulation. [Conference Paper]

Full text not available from this repository.

Abstract

No Abstract

Item Type:Conference Paper
Classifications:Z Theory > Z.250 Geometry
G Algorithms and Complexity > G.999 Others
ID Code:395
Deposited By:Arnopolina, Galina
Deposited On:17 Nov 2004
Last Modified:18 Sep 2008 13:08
Alternative Locations:http://www.springerlink.com/openurl.asp?genre=article&issn=0302-9743&volume=1547&spage=464

Repository Staff Only: item control page

References

1. M. Bern, D. Dobkin, and D. Eppstein. Triangulating polygons without large angles. Intl. J. Comput. Geom. Th. and Appl., 5:171-192, 1995.

2. S. Mitchell. Finding a covering triangulation whose maximum angle is provably small. Proc. 17th Australian Computer Science Conference, pages 55-64, 1994.

3. S. Mitchell. Approximating the maxmin-angle covering triangulation. Comput. Geom. Theo. and Appl., 7:93-111, 1997.

4. H. ElGindy, H. Everett and G.T. Toussaint. Slicing an ear in linear time. Patt. Recog. Lett., 14:719-722, 1993.

GDEA is powered by EPrints 3 which is developed by the School of Electronics and Computer Science at the University of Southampton. More information and software credits.