Matches in DBpedia 2016-04 for { <http://dbpedia.org/resource/Maxima_of_a_point_set> ?p ?o }
Showing triples 1 to 32 of
32
with 100 triples per page.
- Maxima_of_a_point_set abstract "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.".
- Maxima_of_a_point_set thumbnail Maxima_of_a_point_set.svg?width=300.
- Maxima_of_a_point_set wikiPageID "48064477".
- Maxima_of_a_point_set wikiPageLength "7528".
- Maxima_of_a_point_set wikiPageOutDegree "14".
- Maxima_of_a_point_set wikiPageRevisionID "706419911".
- Maxima_of_a_point_set wikiPageWikiLink Category:Computational_geometry.
- Maxima_of_a_point_set wikiPageWikiLink Computational_geometry.
- Maxima_of_a_point_set wikiPageWikiLink Convex_hull.
- Maxima_of_a_point_set wikiPageWikiLink Finite_set.
- Maxima_of_a_point_set wikiPageWikiLink Herbert_Freeman.
- Maxima_of_a_point_set wikiPageWikiLink Integer.
- Maxima_of_a_point_set wikiPageWikiLink Integer_sorting.
- Maxima_of_a_point_set wikiPageWikiLink Orthogonal_convex_hull.
- Maxima_of_a_point_set wikiPageWikiLink Pareto_efficiency.
- Maxima_of_a_point_set wikiPageWikiLink Self-balancing_binary_search_tree.
- Maxima_of_a_point_set wikiPageWikiLink Time_complexity.
- Maxima_of_a_point_set wikiPageWikiLink Vacuous_truth.
- Maxima_of_a_point_set wikiPageWikiLink Van_Emde_Boas_tree.
- Maxima_of_a_point_set wikiPageWikiLink File:Maxima_of_a_point_set.svg.
- Maxima_of_a_point_set wikiPageWikiLinkText "Maxima of a point set".
- Maxima_of_a_point_set wikiPageWikiLinkText "maxima of a point set".
- Maxima_of_a_point_set wikiPageUsesTemplate Template:Hsp.
- Maxima_of_a_point_set wikiPageUsesTemplate Template:Math.
- Maxima_of_a_point_set wikiPageUsesTemplate Template:Mvar.
- Maxima_of_a_point_set wikiPageUsesTemplate Template:Reflist.
- Maxima_of_a_point_set subject Category:Computational_geometry.
- Maxima_of_a_point_set comment "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.".
- Maxima_of_a_point_set label "Maxima of a point set".
- Maxima_of_a_point_set wasDerivedFrom Maxima_of_a_point_set?oldid=706419911.
- Maxima_of_a_point_set depiction Maxima_of_a_point_set.svg.
- Maxima_of_a_point_set isPrimaryTopicOf Maxima_of_a_point_set.