Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Soukal, Roman | |
| dc.date.accessioned | 2016-06-22T06:20:16Z | |
| dc.date.available | 2016-06-22T06:20:16Z | |
| dc.date.issued | 2010 | |
| dc.identifier.uri | http://www.kiv.zcu.cz/publications/ | |
| dc.identifier.uri | http://hdl.handle.net/11025/21565 | |
| dc.format | 61 s. | cs |
| dc.format.mimetype | application/pdf | |
| dc.language.iso | en | en |
| dc.publisher | University of West Bohemia in Pilsen | en |
| dc.rights | © University of West Bohemia in Pilsen | en |
| dc.subject | výpočetní geometrie | cs |
| dc.subject | procházkový algoritmus | cs |
| dc.subject | body | cs |
| dc.title | Walking location algorithms: technical report no. DCSE/TR-2010-03 | en |
| dc.type | zpráva | cs |
| dc.type | report | en |
| dc.rights.access | openAccess | en |
| dc.type.version | publishedVersion | en |
| dc.description.abstract-translated | The point location problem is one of the most frequent tasks in computational geometry. The walking algorithms are one of the most popular solutions for finding an element in a mesh which contains a query point. Despite their suboptimal complexity, the walking algorithms are very popular because they do not require any additional memory and their implementation is simple. | en |
| dc.subject.translated | computational geometry | en |
| dc.subject.translated | walking algorithm | en |
| dc.subject.translated | points | en |
| Appears in Collections: | Zprávy / Reports (KIV) | |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| Soukal.pdf | Plný text | 7,65 MB | Adobe PDF | View/Open |
Please use this identifier to cite or link to this item:
http://hdl.handle.net/11025/21565Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.