About: Straight Walk Algorithm Modification for Point location in a Trianglulation     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
  • Finding an element in a mesh which contains a query point is a very frequent task in computational geometry. The best known algorithms use additional data structures and achieve O(log n) complexity per point query, but using of additional data structures brings some disadvantages. Generally walking algorithms are suboptimal because they do not achieve the logarithmic per point complexity. Despite this problem walking algorithms are very popular because they do not require any additional memory and their implementation is relatively simpler than the logarithmic complexity solutions. This paper brings overview of algorithms from all three known planar walking strategies (Visibility walk, Straight walk and Orthogonal walk). Our goal is to introduce algorithms of mentioned techniques and compare each of them with each other.
  • Finding an element in a mesh which contains a query point is a very frequent task in computational geometry. The best known algorithms use additional data structures and achieve O(log n) complexity per point query, but using of additional data structures brings some disadvantages. Generally walking algorithms are suboptimal because they do not achieve the logarithmic per point complexity. Despite this problem walking algorithms are very popular because they do not require any additional memory and their implementation is relatively simpler than the logarithmic complexity solutions. This paper brings overview of algorithms from all three known planar walking strategies (Visibility walk, Straight walk and Orthogonal walk). Our goal is to introduce algorithms of mentioned techniques and compare each of them with each other. (en)
Title
  • Straight Walk Algorithm Modification for Point location in a Trianglulation
  • Straight Walk Algorithm Modification for Point location in a Trianglulation (en)
skos:prefLabel
  • Straight Walk Algorithm Modification for Point location in a Trianglulation
  • Straight Walk Algorithm Modification for Point location in a Trianglulation (en)
skos:notation
  • RIV/49777513:23520/09:00502676!RIV10-GA0-23520___
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • P(GA201/09/0097)
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
  • 343925
http://linked.open...ai/riv/idVysledku
  • RIV/49777513:23520/09:00502676
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • waling algorithms; point location; straicht walis (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...ontrolniKodProRIV
  • [EF97DBD9CFA4]
http://linked.open...in/vavai/riv/obor
http://linked.open...ichTvurcuVysledku
http://linked.open...cetTvurcuVysledku
http://linked.open...vavai/riv/projekt
http://linked.open...UplatneniVysledku
http://linked.open...iv/tvurceVysledku
  • Kolingerová, Ivana
  • Soukal, Roman
http://localhost/t...ganizacniJednotka
  • 23520
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, 48 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software