Problémy konvexity na povrchu mnohostěnů

Kód výsledku v IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23520%2F08%3A00500884" target="_blank" >RIV/49777513:23520/08:00500884 - isvavai.cz</a>
Výsledek na webu
—
DOI - Digital Object Identifier
—

Jazyk výsledku
angličtina
Název v původním jazyce
Problems of Convexity on Polyhedral Surfaces
Popis výsledku v původním jazyce
Convex hull is one of the fundamental problems in computational geometry. It is a useful tool for constructing other structures and a necessary instrument for solving many computational problems. A convex area is unambiguously defined on the plane according to several definitions which hold equivalently. However, how can we recognize whether a set lying on a polyhedral surface is convex or non-convex? Is it possible to define a convexity on a polyhedral surface correctly? The answer to these and many other questions is the aim of our article.
Název v anglickém jazyce
Problems of Convexity on Polyhedral Surfaces
Popis výsledku anglicky
Convex hull is one of the fundamental problems in computational geometry. It is a useful tool for constructing other structures and a necessary instrument for solving many computational problems. A convex area is unambiguously defined on the plane according to several definitions which hold equivalently. However, how can we recognize whether a set lying on a polyhedral surface is convex or non-convex? Is it possible to define a convexity on a polyhedral surface correctly? The answer to these and many other questions is the aim of our article.

Rok uplatnění
2008
Kód důvěrnosti údajů
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Podobné výsledky(10)