Convex Hulls

Vladimir Rovenski
Additional contact information
Vladimir Rovenski: University of Haifa and Technion, Department of Mathematics

Chapter 16 in Geometry of Curves and Surfaces with MAPLE, 2000, pp 189-190 from Springer

Abstract: Abstract A convex polygon is a particular case of a plane convex curve. In Sections 4.2, 14.3, 14.4.1 the notion of the convex hull (CH) of a finite planar set P = {Pl, P2, … , P n } of points was used.

Keywords: Computational Complexity; Convex Hull; Initial Point; Computer Graphic; Computational Efficiency (search for similar items in EconPapers)
Date: 2000
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4612-2128-9_17

Ordering information: This item can be ordered from
http://www.springer.com/9781461221289

DOI: 10.1007/978-1-4612-2128-9_17

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().