On Intersecting a Set of Isothetic Line Segments with a Convex Polygon of Minimum Area

机译：关于具有最小面积的凸多边形与等距线段相交

获取原文

获取原文并翻译 | 示例

页面导航

摘要
著录项
引文网络
相似文献
相关主题

摘要

We describe an O(n~2)-time algorithm for computing a minimum-area convex polygon that intersects a set of n isothetic line segments.

机译：我们描述了一种O（n〜2）时间算法，用于计算与一组n个等距线段相交的最小面积凸多边形。

著录项

来源
《International Conference on Computational Science and Its Applications(ICCSA 2007) pt.1; 20070826-29; Kuala Lumpur(MY)》|2007年|P.41-54|共14页
会议地点 Kuala Lumpur(MY)
作者
Asish Mukhopadhyay; Eugene Greene; S.V. Rao;
展开▼
作者单位

School of Computer Science, University of Windsor, Canada;

Department of Comp. Sc. and Engg., IIT Guwahati, India;

展开▼
会议组织
原文格式 PDF
正文语种 eng
中图分类计算技术、计算机技术;
关键词

相似文献

外文文献
中文文献
专利

1. ON INTERSECTING A SET OF ISOTHETIC LINE SEGMENTS WITH A CONVEX POLYGON OF MINIMUM AREA [J] . Mukhopadhyay A, Greene E, Rao SV International journal of computational geometry & applications . 2009,第6期

机译：套等值线段与最小面积的凸多边形相交
2. On intersecting a set of parallel line segments with a convex polygon of minimum area [J] . Asish Mukhopadhyay, Chanchal Kumar, Eugene Greene, Information Processing Letters . 2008,第2期

机译：在将一组平行线段与最小面积的凸多边形相交时
3. On intersecting a set of parallel line segments with a convex polygon of minimum area [J] . Asish Mukhopadhyay, Chanchal Kumar, Eugene Greene, Information Processing Letters . 2007,第2期

机译：在将一组平行线段与最小面积的凸多边形相交时
4. On Intersecting a Set of Isothetic Line Segments with a Convex Polygon of Minimum Area [C] . Asish Mukhopadhyay, Eugene Greene, S. V. Rao International Conference on Computational Science and Its Applications . 2007

机译：在与最小面积的凸多边形相交的一组凸起线段
5. Computing the minimum perimeter triangle enclosing a convex polygon: Theory and implementation. [D] . Medvedeva, Anna Valentinovna. 2003

机译：计算包围凸多边形的最小周长三角形：理论和实现。
6. Interpolation Error Estimates for Mean Value Coordinates over Convex Polygons [O] . Alexander Rand, Andrew Gillette, Chandrajit Bajaj -1

机译：凸多边形均值坐标的插值误差估计
7. OPTIMAL SHORTEST PATH AND MINIMUM-LINK PATH QUERIES BETWEEN TWO CONVEX POLYGONS Inside a Simple Polygonal Obstacle [O] . Yi-jen Chiang, Roberto Tamassia 1994

机译：简单多边形障碍内两个凸多边形之间的最佳路径和最小路径路径查询

On Intersecting a Set of Isothetic Line Segments with a Convex Polygon of Minimum Area

摘要

著录项

引文网络

相似文献

相关主题

期刊订阅