About: Fast Approximation of Convex Hull     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

AttributesValues
rdf:type
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. (en)
Title
  • Fast Approximation of Convex Hull
  • Fast Approximation of Convex Hull (en)
skos:prefLabel
  • Fast Approximation of Convex Hull
  • Fast Approximation of Convex Hull (en)
skos:notation
  • RIV/68407700:21230/06:00118558!RIV11-MSM-21230___
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • S, Z(MSM6840770014)
http://linked.open...vai/riv/dodaniDat
http://linked.open...aciTvurceVysledku
http://linked.open.../riv/druhVysledku
http://linked.open...iv/duvernostUdaju
http://linked.open...titaPredkladatele
http://linked.open...dnocenehoVysledku
  • 475573
http://linked.open...ai/riv/idVysledku
  • RIV/68407700:21230/06:00118558
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • approximation; convex hull; linear time (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...ontrolniKodProRIV
  • [01DF741F36FC]
http://linked.open...v/mistoKonaniAkce
  • Puerto Vallarta, Mexico
http://linked.open...i/riv/mistoVydani
  • Calgary
http://linked.open...i/riv/nazevZdroje
  • Advances in Computer Science and Technology - ACST 2006
http://linked.open...in/vavai/riv/obor
http://linked.open...ichTvurcuVysledku
http://linked.open...cetTvurcuVysledku
http://linked.open...UplatneniVysledku
http://linked.open...iv/tvurceVysledku
  • Kavan, Ladislav
  • Žára, Jiří
  • Kolingerová, I.
http://linked.open...vavai/riv/typAkce
http://linked.open...ain/vavai/riv/wos
  • 000239655600018
http://linked.open.../riv/zahajeniAkce
http://linked.open...n/vavai/riv/zamer
number of pages
http://purl.org/ne...btex#hasPublisher
  • IASTED
https://schema.org/isbn
  • 0-88986-545-0
http://localhost/t...ganizacniJednotka
  • 21230
Faceted Search & Find service v1.16.118 as of Jun 21 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 25 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software