About: Convex hull algorithms

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: Convex hull algorithms Goto Sponge NotDistinct Permalink

An Entity of Type : owl:Thing, within Data Space : el.dbpedia.org associated with source document(s)

Algorithms that construct convex hulls of various objects have a broad range of applications in mathematics and computer science. In computational geometry, numerous algorithms are proposed for computing the convex hull of a finite set of points, with various computational complexities. Computing the convex hull means that a non-ambiguous and efficient representation of the required convex shape is constructed. The complexity of the corresponding algorithms is usually estimated in terms of n, the number of input points, and sometimes also in terms of h, the number of points on the convex hull.

Attributes	Values
rdfs:label	Convex hull algorithms (en)
rdfs:comment	Algorithms that construct convex hulls of various objects have a broad range of applications in mathematics and computer science. In computational geometry, numerous algorithms are proposed for computing the convex hull of a finite set of points, with various computational complexities. Computing the convex hull means that a non-ambiguous and efficient representation of the required convex shape is constructed. The complexity of the corresponding algorithms is usually estimated in terms of n, the number of input points, and sometimes also in terms of h, the number of points on the convex hull. (en)
sameAs	Convex hull algorithms Convex hull algorithms
dbp:wikiPageUsesTemplate	dbt:Cite_book dbt:Harvtxt dbt:ISBN dbt:Main dbt:MathWorld dbt:Reflist dbt:Short_description dbt:Wikibooks
Subject	Convex hull algorithms
Link from a Wikipage to an external page	https://archive.org/details/computationalgeo00berg http://wayback.vefsafn.is/wayback/20130721095350/http:/michal.is/projects/convex%2Dhull%2Dgift%2Dwrapping%2Dmethod/ http://www.cgal.org/Part/ConvexHullAlgorithms http://www.qhull.org/ https://web.archive.org/web/20101127013711/http:/computacion.cs.cinvestav.mx/~anzures/geom/hull.html
prov:wasDerivedFrom	http://en.wikipedia.org/wiki/Convex_hull_algorithms?oldid=1024320937&ns=0
Wikipage page ID	11700432 (xsd:integer)
page length (characters) of wiki page	16461 (xsd:nonNegativeInteger)
Wikipage revision ID	1024320937 (xsd:integer)
Link from a Wikipage to another Wikipage	Franco P. Preparata Ron Rivest Ronald Graham Analysis of algorithms Big O notation Raimund Seidel Selim Akl Output-sensitive algorithm CGAL Convex hull algorithms Gift wrapping algorithm Godfried Toussaint David G. Kirkpatrick Quadrilateral Chan's algorithm Charles E. Leiserson Decision tree model Kirkpatrick–Seidel algorithm Sorting Springer Science+Business Media Time complexity Timothy M. Chan Clifford Stein Computational geometry Computer science Convex function Convex hull Convex polygon Convex polytope Dynamic convex hull Orthogonal convex hull Data structure Graham scan Face (geometry) Half-space (geometry) Integer sorting Introduction to Algorithms LP-type problem Parabola Stack (abstract data type) Mathematics Quickhull Quicksort Reduction (complexity) Simple polygon Thomas H. Cormen dbr:Divide_and_conquer_(Convex_Hull) dbr:S.J._Hong dbr:Wikibooks:Algorithm_Implementation/Geometry/Convex_hull/Monotone_chain
has abstract	Algorithms that construct convex hulls of various objects have a broad range of applications in mathematics and computer science. In computational geometry, numerous algorithms are proposed for computing the convex hull of a finite set of points, with various computational complexities. Computing the convex hull means that a non-ambiguous and efficient representation of the required convex shape is constructed. The complexity of the corresponding algorithms is usually estimated in terms of n, the number of input points, and sometimes also in terms of h, the number of points on the convex hull. (en)
foaf:isPrimaryTopicOf	http://en.wikipedia.org/wiki/Convex_hull_algorithms
is Wikipage redirect of	Convex hull algorithm
is Link from a Wikipage to another Wikipage of	Algorithmic Geometry Bounding volume Geometric and Topological Inference Gift wrapping algorithm Godfried Toussaint Chan's algorithm Delaunay triangulation Kirkpatrick–Seidel algorithm Convex hull algorithm Convex hull of a simple polygon Convex polytope List of algorithms Graham scan
is foaf:primaryTopic of	http://en.wikipedia.org/wiki/Convex_hull_algorithms

Faceted Search & Find service v1.17_git151 as of Feb 20 2025

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Nov 11 2024, on Linux (x86_64-ubuntu_focal-linux-gnu), Single-Server Edition (71 GB total memory, 1 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2025 OpenLink Software