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

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

Namespace Prefixes

PrefixIRI
n10http://linked.opendata.cz/ontology/domain/vavai/riv/typAkce/
dctermshttp://purl.org/dc/terms/
n18http://localhost/temp/predkladatel/
n17http://purl.org/net/nknouf/ns/bibtex#
n9http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n5http://linked.opendata.cz/ontology/domain/vavai/
n16https://schema.org/
n14http://linked.opendata.cz/resource/domain/vavai/zamer/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
n3http://linked.opendata.cz/ontology/domain/vavai/riv/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n15http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F68407700%3A21230%2F06%3A00118558%21RIV11-MSM-21230___/
n8http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n13http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n20http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n12http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n21http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n4http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n6http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F68407700%3A21230%2F06%3A00118558%21RIV11-MSM-21230___
rdf:type
n5:Vysledek skos:Concept
dcterms:description
The construction of a planar convex hull is an essential operation in computational geometry. It has been proven that the time complexity of an exact solution is $\\Omega(N log N)$. In this paper, we describe an algorithm with time complexity $O(N + k^2)$, where $k$ is parameter controlling the approximation quality. This is beneficial for applications processing a large number of points without necessity of an exact solution. A formula for upper bound of the approximation error is presented. The construction of a planar convex hull is an essential operation in computational geometry. It has been proven that the time complexity of an exact solution is $\\Omega(N log N)$. In this paper, we describe an algorithm with time complexity $O(N + k^2)$, where $k$ is parameter controlling the approximation quality. This is beneficial for applications processing a large number of points without necessity of an exact solution. A formula for upper bound of the approximation error is presented.
dcterms:title
Fast Approximation of Convex Hull Fast Approximation of Convex Hull
skos:prefLabel
Fast Approximation of Convex Hull Fast Approximation of Convex Hull
skos:notation
RIV/68407700:21230/06:00118558!RIV11-MSM-21230___
n3:aktivita
n12:Z n12:S
n3:aktivity
S, Z(MSM6840770014)
n3:dodaniDat
n6:2011
n3:domaciTvurceVysledku
n9:8884757 n9:7283156
n3:druhVysledku
n21:D
n3:duvernostUdaju
n13:S
n3:entitaPredkladatele
n15:predkladatel
n3:idSjednocenehoVysledku
475573
n3:idVysledku
RIV/68407700:21230/06:00118558
n3:jazykVysledku
n20:eng
n3:klicovaSlova
approximation; convex hull; linear time
n3:klicoveSlovo
n8:approximation n8:convex%20hull n8:linear%20time
n3:kontrolniKodProRIV
[01DF741F36FC]
n3:mistoKonaniAkce
Puerto Vallarta, Mexico
n3:mistoVydani
Calgary
n3:nazevZdroje
Advances in Computer Science and Technology - ACST 2006
n3:obor
n4:IN
n3:pocetDomacichTvurcuVysledku
2
n3:pocetTvurcuVysledku
3
n3:rokUplatneniVysledku
n6:2006
n3:tvurceVysledku
Kavan, Ladislav Žára, Jiří Kolingerová, I.
n3:typAkce
n10:WRD
n3:wos
000239655600018
n3:zahajeniAkce
2006-01-23+01:00
n3:zamer
n14:MSM6840770014
s:numberOfPages
4
n17:hasPublisher
IASTED
n16:isbn
0-88986-545-0
n18:organizacniJednotka
21230