Point-in-Convex Polygon and Point-in-Convex Polyhedron Algorithms with O(1) Complexity using Space Subdivision
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23520%2F16%3A43929509" target="_blank" >RIV/49777513:23520/16:43929509 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1063/1.4952270" target="_blank" >http://dx.doi.org/10.1063/1.4952270</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1063/1.4952270" target="_blank" >10.1063/1.4952270</a>
Alternative languages
Result language
angličtina
Original language name
Point-in-Convex Polygon and Point-in-Convex Polyhedron Algorithms with O(1) Complexity using Space Subdivision
Original language description
New Point-in-Convex Polygon and Point-in-Convex Polyhedron algorithms are presented based on space subdivision in the preprocessing stage resulting to ??1? run-time complexity.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
JC - Computer hardware and software
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/LH12181" target="_blank" >LH12181: Development of Algorithms for Computer Graphics and CAD/CAM systems</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2016
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
International Conference of Numerical Analysis and Applied Mathematics 2015 (ICNAAM 2015) ; Volume 1738
ISBN
978-0-7354-1392-4
ISSN
0094-243X
e-ISSN
—
Number of pages
4
Pages from-to
1-4
Publisher name
American Institute of Physics
Place of publication
—
Event location
Rhodos
Event date
Sep 22, 2015
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
000380803300487