About: A new visibility walk algorithm for point location in planar triangulation

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: A new visibility walk algorithm for point location in planar triangulation 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)

Attributes	Values
rdf:type	skos:Concept http://linked.opendata.cz/ontology/domain/vavai/Vysledek
Description	Finding which triangle in a planar triangle mesh contains a query point is one of the most frequent tasks in computational geometry. Usually, a large number of point locations has to be performed, and so there is a need for fast algorithms resistant to changes in triangulation and having minimal additional memory requirements. The so-called walking algorithms offer low complexity, easy implementation and negligible additional memory requirements, which makes them suitable for such applications. In this paper, we propose a walking algorithm which significantly improves the current barycentric approach and propose how to effectively combine this algorithm with a suitable hierarchical structure in order to improve its computational complexity. The hierarchical data structure used in our solution is easy to implement and requires low additional memory while providing a significant acceleration thanks to the logarithmic computational complexity of the search process. Finding which triangle in a planar triangle mesh contains a query point is one of the most frequent tasks in computational geometry. Usually, a large number of point locations has to be performed, and so there is a need for fast algorithms resistant to changes in triangulation and having minimal additional memory requirements. The so-called walking algorithms offer low complexity, easy implementation and negligible additional memory requirements, which makes them suitable for such applications. In this paper, we propose a walking algorithm which significantly improves the current barycentric approach and propose how to effectively combine this algorithm with a suitable hierarchical structure in order to improve its computational complexity. The hierarchical data structure used in our solution is easy to implement and requires low additional memory while providing a significant acceleration thanks to the logarithmic computational complexity of the search process. (en)
Title	A new visibility walk algorithm for point location in planar triangulation A new visibility walk algorithm for point location in planar triangulation (en)
skos:prefLabel	A new visibility walk algorithm for point location in planar triangulation A new visibility walk algorithm for point location in planar triangulation (en)
skos:notation	RIV/49777513:23520/12:43915733!RIV13-GA0-23520___
http://linked.open...avai/predkladatel	Fakulta aplikovaných věd
http://linked.open...avai/riv/aktivita	P S
http://linked.open...avai/riv/aktivity	P(GAP202/10/1435), S
http://linked.open...vai/riv/dodaniDat	2013
http://linked.open...aciTvurceVysledku	Kolingerová, Ivana Málková, Martina Soukal, Roman
http://linked.open.../riv/druhVysledku	D - Článek ve sborníku
http://linked.open...iv/duvernostUdaju	S - Úplné a pravdivé údaje nepodléhající ochraně podle zvláštních právních předpisů
http://linked.open...titaPredkladatele	Západočeská univerzita v Plzni / Fakulta aplikovaných věd
http://linked.open...dnocenehoVysledku	120422
http://linked.open...ai/riv/idVysledku	RIV/49777513:23520/12:43915733
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	visibility walk algorithm; planar triangulation; point location (en)
http://linked.open.../riv/klicoveSlovo	point location planar triangulation visibility walk algorithm
http://linked.open...ontrolniKodProRIV	[F87251DF370D]
http://linked.open...v/mistoKonaniAkce	Kréta, Rethymnon
http://linked.open...i/riv/mistoVydani	Heidelberg, Berlin
http://linked.open...i/riv/nazevZdroje	Advances in Visual Computing, 8th International Symposium, ISVC 2012
http://linked.open...in/vavai/riv/obor	IN
http://linked.open...ichTvurcuVysledku	3 (xsd:int)
http://linked.open...cetTvurcuVysledku	3 (xsd:int)
http://linked.open...vavai/riv/projekt	Analysis and Visualization of Protein Structures
http://linked.open...UplatneniVysledku	2012
http://linked.open...iv/tvurceVysledku	Kolingerová, Ivana Málková, Martina Soukal, Roman
http://linked.open...vavai/riv/typAkce	WRD - Světová
http://linked.open.../riv/zahajeniAkce	2012-07-16 (xsd:date)
issn	0302-9743
number of pages	10 (xsd:int)
http://bibframe.org/vocab/doi	10.1007/978-3-642-33191-6_73
http://purl.org/ne...btex#hasPublisher	Springer-Verlag
https://schema.org/isbn	978-3-642-33191-6
http://localhost/t...ganizacniJednotka	23520
is http://linked.open...avai/riv/vysledek of	A new visibility walk algorithm for point location in planar triangulation

Faceted Search & Find service v1.16.118 as of Jun 21 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

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, 58 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software