首页> 外文期刊>SIGACT News >Computational Geometry Column 51
【24h】

Computational Geometry Column 51

机译:计算几何列51

获取原文
获取原文并翻译 | 示例
           

摘要

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.
机译:可以始终对简单的球形多边形进行三角剖分吗?答案取决于“多边形”和“三角剖分”的定义。将球面多边形定义为球体S上的简单闭合曲线,该球体由在顶点相交的有限数量的大圆弧(也称为测地弧)组成。是否可以对每个球形多边形进行三角剖分?图1显示了预期的示例。1平面模拟是众所周知的,并且是计算几何的基石:可以对每个平面简单多边形的内部进行三角剖分(并有效地进行三角剖分)。球形多边形的情况并非如此简单。有三个并发症。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号