Computational geometry column 51
| Autor: | Joseph O'Rourke |
|---|---|
| Rok vydání: | 2008 |
| Předmět: |
Multidisciplinary
Polygon covering Computer Science::Information Retrieval Midpoint polygon Computer Science::Computational Geometry Pick's theorem Combinatorics Monotone polygon TheoryofComputation_ANALYSISOFALGORITHMSANDPROBLEMCOMPLEXITY Polygon Equilateral polygon Simple polygon MathematicsofComputing_DISCRETEMATHEMATICS ComputingMethodologies_COMPUTERGRAPHICS Mathematics Affine-regular polygon |
| Zdroj: | ACM SIGACT News. 39:58-62 |
| ISSN: | 0163-5700 |
| DOI: | 10.1145/1412700.1412714 |
| Popis: | Can a simple spherical polygon always be triangulated? The answer depends on the definitions of "polygon" and "triangulate". Define a spherical polygon to be a simple, closed curve on a sphere S composed of a finite number of great circle arcs (also known as geodesic arcs) meeting at vertices. Can every spherical polygon be triangulated? Figure 1 shows an example of what is intended. 1 The planar analog is well-known and a cornerstone of computational geometry: the interior of every planar simple polygon can be triangulated (and efficiently so). The situation for spherical polygons is not so straightforward. There are three complications. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|