Minimum area polygons with two reflex angles enclosing k Points

We present in this paper, algorithms for finding the minimum area isothetic polygons having two reflex angles containing k points; (k<n) Our algorithms are based on line sweep paradigm. The idea is to enumerate all the polygons in each kind and find the minimum one. We also analyse the complexiti...

Full description

Saved in:

Bibliographic Details
Published in:	International journal of computer mathematics Vol. 77; no. 4; pp. 507 - 522
Main Authors:	Krithivasan, Kamala, Srilakshmi, Vanam
Format:	Journal Article
Language:	English
Published:	Abingdon Gordon and Breach Science Publishers 01.01.2001 Taylor and Francis
Subjects:	Algorithmics. Computability. Computer arithmetics Applied sciences Computer science; control theory; systems Convex and discrete geometry Exact sciences and technology F.2.2[Analysis of Algorithms and Problem Complexity] Geometry I.3.5[Computational Geometry and Object Modeling] Isothetic polygon with reflex angles Line sweep paradigm Mathematics Methods of scientific computing (including symbolic computation, algebraic computation) Minimum area polygon Numerical analysis Numerical analysis. Scientific computation Numerical methods in probability and statistics Optimization problem Orthoconvex polygon Polygon enclosing points Sciences and techniques of general use Theoretical computing Computational geometry Isothetic polygon Minimum area polygon Computational complexity Optimization Orthoconvex polygon
ISSN:	0020-7160, 1029-0265
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!