| http://dbpedia.org/ontology/abstract
|
In computational geometry, a point p in a … In computational geometry, a point p in a finite set of points S is said to be maximal or non-dominated if there is no other point q in S whose coordinates are all greater than or equal to the corresponding coordinates of p. The maxima of a point set S are all the maximal points of S.The problem of finding all maximal points, sometimes called the problem of the maxima or maxima set problem, has been studied as a variant of the convex hull and orthogonal convex hull problems. It is equivalent to finding the Pareto frontier of a collection of points, and was called the floating-currency problem by Herbert Freeman based on an application involving comparing the relative wealth of individuals with different holdings of multiple currencies.different holdings of multiple currencies.
|
| http://dbpedia.org/ontology/thumbnail
|
http://commons.wikimedia.org/wiki/Special:FilePath/Maxima_of_a_point_set.svg?width=300 +
|
| http://dbpedia.org/ontology/wikiPageID
|
48064477
|
| http://dbpedia.org/ontology/wikiPageLength
|
7828
|
| http://dbpedia.org/ontology/wikiPageRevisionID
|
1038770021
|
| http://dbpedia.org/ontology/wikiPageWikiLink
|
http://dbpedia.org/resource/Linear_time +
, http://dbpedia.org/resource/Herbert_Freeman +
, http://dbpedia.org/resource/File:Maxima_of_a_point_set.svg +
, http://dbpedia.org/resource/Computational_geometry +
, http://dbpedia.org/resource/Category:Computational_geometry +
, http://dbpedia.org/resource/Integer_sorting +
, http://dbpedia.org/resource/Vacuous_truth +
, http://dbpedia.org/resource/Finite_set +
, http://dbpedia.org/resource/Integer +
, http://dbpedia.org/resource/Balanced_binary_search_tree +
, http://dbpedia.org/resource/Van_Emde_Boas_tree +
, http://dbpedia.org/resource/Convex_hull +
, http://dbpedia.org/resource/Pareto_frontier +
, http://dbpedia.org/resource/Orthogonal_convex_hull +
|
| http://dbpedia.org/property/wikiPageUsesTemplate
|
http://dbpedia.org/resource/Template:Hsp +
, http://dbpedia.org/resource/Template:Mvar +
, http://dbpedia.org/resource/Template:Math +
, http://dbpedia.org/resource/Template:Reflist +
|
| http://purl.org/dc/terms/subject
|
http://dbpedia.org/resource/Category:Computational_geometry +
|
| http://www.w3.org/ns/prov#wasDerivedFrom
|
http://en.wikipedia.org/wiki/Maxima_of_a_point_set?oldid=1038770021&ns=0 +
|
| http://xmlns.com/foaf/0.1/depiction
|
http://commons.wikimedia.org/wiki/Special:FilePath/Maxima_of_a_point_set.svg +
|
| http://xmlns.com/foaf/0.1/isPrimaryTopicOf
|
http://en.wikipedia.org/wiki/Maxima_of_a_point_set +
|
| owl:sameAs |
http://www.wikidata.org/entity/Q25304220 +
, http://dbpedia.org/resource/Maxima_of_a_point_set +
, https://global.dbpedia.org/id/2P4U2 +
|
| rdfs:comment |
In computational geometry, a point p in a … In computational geometry, a point p in a finite set of points S is said to be maximal or non-dominated if there is no other point q in S whose coordinates are all greater than or equal to the corresponding coordinates of p. The maxima of a point set S are all the maximal points of S.The problem of finding all maximal points, sometimes called the problem of the maxima or maxima set problem, has been studied as a variant of the convex hull and orthogonal convex hull problems. It is equivalent to finding the Pareto frontier of a collection of points, and was called the floating-currency problem by Herbert Freeman based on an application involving comparing the relative wealth of individuals with different holdings of multiple currencies.different holdings of multiple currencies.
|
| rdfs:label |
Maxima of a point set
|
