This HTML5 document contains 27 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dcthttp://purl.org/dc/terms/
yago-reshttp://yago-knowledge.org/resource/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
dbthttp://dbpedia.org/resource/Template:
rdfshttp://www.w3.org/2000/01/rdf-schema#
freebasehttp://rdf.freebase.com/ns/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
n11http://en.wikipedia.org/wiki/
dbchttp://dbpedia.org/resource/Category:
provhttp://www.w3.org/ns/prov#
dbphttp://dbpedia.org/property/
xsdhhttp://www.w3.org/2001/XMLSchema#
goldhttp://purl.org/linguistics/gold/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:Dynamic_convex_hull
rdf:type
dbo:Disease
rdfs:label
Dynamic convex hull
rdfs:comment
The dynamic convex hull problem is a class of dynamic problems in computational geometry. The problem consists in the maintenance, i.e., keeping track, of the convex hull for input data undergoing a sequence of discrete changes, i.e., when input data elements may be inserted, deleted, or modified. It should be distinguished from the kinetic convex hull, which studies similar problems for continuously moving points. Dynamic convex hull problems may be distinguished by the types of the input data and the allowed types of modification of the input data.
owl:sameAs
freebase:m.02rhg0m yago-res:Dynamic_convex_hull
dbp:wikiPageUsesTemplate
dbt:Citation
dct:subject
dbc:Convex_hull_algorithms
gold:hypernym
dbr:Problems
prov:wasDerivedFrom
n11:Dynamic_convex_hull?oldid=1007271053&ns=0
dbo:wikiPageID
11543042
dbo:wikiPageLength
6209
dbo:wikiPageRevisionID
1007271053
dbo:wikiPageWikiLink
dbr:Kinetic_convex_hull dbc:Convex_hull_algorithms dbr:Dynamic_problem_(algorithms) dbr:Upper_and_lower_bounds dbr:Journal_of_Computer_and_System_Sciences dbr:Geometric_search_problems dbr:Point_in_polygon dbr:Timothy_M._Chan dbr:Analysis_of_algorithms dbr:Sorting dbr:Convex_hull dbr:Computational_geometry dbr:Journal_of_the_ACM
dbo:abstract
The dynamic convex hull problem is a class of dynamic problems in computational geometry. The problem consists in the maintenance, i.e., keeping track, of the convex hull for input data undergoing a sequence of discrete changes, i.e., when input data elements may be inserted, deleted, or modified. It should be distinguished from the kinetic convex hull, which studies similar problems for continuously moving points. Dynamic convex hull problems may be distinguished by the types of the input data and the allowed types of modification of the input data.
foaf:isPrimaryTopicOf
n11:Dynamic_convex_hull