Reversibly Visible Polygons and Polygonal Approximation in Two Dimensional Space

CC
CGI
1997
Computer Graphics International 1997 (CGI'97)
Abstract - Reversibly Visible Polygons and Polygonal Approximation in Two Dimensional Space

	This Article
	Subscribers, please Login Purchase article: $19 PDF IEEE Xplore Subscribers RSS feed
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by Sasipalli V S Rao Articles by Harada Koichi

Computer Graphics International 1997 (CGI'97)

Hasselt and Diepenbeek, Belgium

June 23-June 27

ISBN: 0-8186-7825-9

	ASCII Text	x
	Sasipalli V S Rao, Harada Koichi, "Reversibly Visible Polygons and Polygonal Approximation in Two Dimensional Space," Computer Graphics International Conference, pp. 74, Computer Graphics International 1997 (CGI'97), 1997.

	BibTex	x
	@article{ 10.1109/CGI.1997.601276, author = {Sasipalli V S Rao and Harada Koichi}, title = {Reversibly Visible Polygons and Polygonal Approximation in Two Dimensional Space}, journal ={Computer Graphics International Conference}, volume = {0}, year = {1997}, isbn = {0-8186-7825-9}, pages = {74}, doi = {http://doi.ieeecomputersociety.org/10.1109/CGI.1997.601276}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Computer Graphics International Conference TI - Reversibly Visible Polygons and Polygonal Approximation in Two Dimensional Space SN - 0-8186-7825-9 SP EP A1 - Sasipalli V S Rao, A1 - Harada Koichi, PY - 1997 VL - 0 JA - Computer Graphics International Conference ER -

Sasipalli V S Rao, Hiroshima University

Harada Koichi, Hiroshima University

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/CGI.1997.601276

A digitized picture in 2D array of points is often desired to be approximated by polygonal lines, with smallest number of sides, under the given error tolerance E. To approximate the polygonal line of such data, we introduce two new terms called ``windows in the edges'' and ``reversibly visible polygons''. And we present linear time algorithms that find minimax polygons, windows in the edges and the reversibly polygons. Based on these algorithms we finally produce a general polygonal line that lies in the reversibly polygon and approximates the polygonal line of given data.Keywords; Polygonal line, approximation, windows in the edges, reversibly visible polygons.

Citation:

Sasipalli V S Rao, Harada Koichi, "Reversibly Visible Polygons and Polygonal Approximation in Two Dimensional Space," cgi, pp.74, Computer Graphics International 1997 (CGI'97), 1997

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.