Dynamic convex hull (original) (raw)
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.
| Property | Value |
|---|---|
| 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. (en) Задача динамічної підтримки опуклої оболонки належить класу динамічних задач обчислювальної геометрії. Вона полягає в підтримці опуклої оболонки для набору вхідних даних що динамічно змінюються, тобто додаються, видаляються або змінюються. (uk) |
| dbo:wikiPageID | 11543042 (xsd:integer) |
| dbo:wikiPageLength | 6209 (xsd:nonNegativeInteger) |
| dbo:wikiPageRevisionID | 1007271053 (xsd:integer) |
| dbo:wikiPageWikiLink | dbr:Dynamic_problem_(algorithms) dbr:Analysis_of_algorithms dbr:Convex_hull dbr:Timothy_M._Chan dbr:Lower_bound dbr:Computational_geometry dbr:Point_in_polygon dbr:Journal_of_Computer_and_System_Sciences dbr:Journal_of_the_ACM dbr:Kinetic_convex_hull dbc:Convex_hull_algorithms dbr:Sorting dbr:Geometric_search_problems |
| dbp:wikiPageUsesTemplate | dbt:Citation |
| dct:subject | dbc:Convex_hull_algorithms |
| gold:hypernym | dbr:Problems |
| rdf:type | yago:WikicatConvexHullAlgorithms yago:Abstraction100002137 yago:Act100030358 yago:Activity100407535 yago:Algorithm105847438 yago:Event100029378 yago:Procedure101023820 yago:PsychologicalFeature100023100 yago:YagoPermanentlyLocatedEntity dbo:Disease yago:Rule105846932 |
| 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. (en) Задача динамічної підтримки опуклої оболонки належить класу динамічних задач обчислювальної геометрії. Вона полягає в підтримці опуклої оболонки для набору вхідних даних що динамічно змінюються, тобто додаються, видаляються або змінюються. (uk) |
| rdfs:label | Dynamic convex hull (en) Задача динамічної підтримки опуклої оболонки (uk) |
| owl:sameAs | freebase:Dynamic convex hull yago-res:Dynamic convex hull wikidata:Dynamic convex hull dbpedia-uk:Dynamic convex hull https://global.dbpedia.org/id/4ioKr |
| prov:wasDerivedFrom | wikipedia-en:Dynamic_convex_hull?oldid=1007271053&ns=0 |
| foaf:isPrimaryTopicOf | wikipedia-en:Dynamic_convex_hull |
| is dbo:wikiPageWikiLink of | dbr:Convex_hull dbr:Convex_hull_algorithms dbr:Computational_geometry dbr:Kinetic_convex_hull dbr:Kinetic_priority_queue dbr:K-set_(geometry) dbr:Bitangent dbr:Relative_convex_hull dbr:Ramer–Douglas–Peucker_algorithm |
| is foaf:primaryTopic of | wikipedia-en:Dynamic_convex_hull |