Comments on “algorithms for reporting and counting geometric intersections”

Brown Kevin Q.

首页> 外文期刊>Computers, IEEE Transactions on >Comments on “algorithms for reporting and counting geometric intersections”

【24h】

Comments on “algorithms for reporting and counting geometric intersections”

机译：关于“报告和计算几何交点的算法”的评论

获取原文

获取原文并翻译 | 示例

掌桥外文数据库（机构版） >>

开具论文收录证明 >>

文献代查 >>

页面导航

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

摘要

Bentley and Ottmann1 present an algorithm for reporting all K intersections among N planar line segments in 0((N + K) log N) time and 0(N + K) storage. With a small modification that storage requirement can be reduced to 0(N) with no increase in computation time, which is important because K can grow as θ(N2).

机译：Bentley和Ottmann 1 提出了一种算法，用于报告0（（N + K）log N）时间和0（N + K）存储的N个平面线段之间的所有K个交点。只需进行很小的修改，就可以在不增加计算时间的情况下将存储需求减少到0（N），这很重要，因为K可以随着θ（N 2 ）增长。

著录项

来源
《Computers, IEEE Transactions on》 |1981年第2期|p.147-148|共2页
作者
Brown Kevin Q.;
展开▼
作者单位

展开▼
收录信息
原文格式 PDF
正文语种 eng
中图分类
关键词
Computational geometry; VLSI design rule checking; geometric intersection problems; optimal algorithms;

机译：计算几何;VLSI设计规则检查;几何相交问题;最优算法;

相似文献

外文文献
中文文献
专利

1. Efficient algorithms for counting and reporting pairwise intersections between convex polygons [J] . Prosenjit Gupta, Ravi Janardan, Michiel Smid Information Processing Letters . 1999,第1期

机译：用于计算和报告凸多边形之间的成对相交的高效算法
2. Geometric Algorithms for Finding a Point in the Intersection of Balls [J] . Lushchakova I. N. Automation and Remote Control . 2020,第5期

机译：用于在球交叉口中找到一个点的几何算法
3. Unified Spatial Intersection Algorithms Based on Conformal Geometric Algebra [J] . Zhang Feng, Jiang Xiaomin, Zhang Xiaoyi, Mathematical Problems in Engineering . 2016,第PTa11期

机译：基于共形几何代数的统一空间相交算法
4. Space-Efficient and Fast Algorithms for Multidimensional Dominance Reporting and Counting [C] . Joseph JaJa, Christian W. Mortensen, Qingmin Shi International Symposium on Algorithms and Computation(ISAAC 2004); 20041220-22; Hong Kong(CN) . 2004

机译：多维优势报告和计数的省空间快速算法
5. Algorithms and Data Structures for Geometric Intersection Query Problems [D] . Saladi, Rahul. 2017

机译：几何相交查询问题的算法和数据结构
6. Binary Interval Search: a scalable algorithm for counting interval intersections [O] . Ryan M. Layer, Kevin Skadron, Gabriel Robins, -1

机译：Binary Interval Search：二进制间隔搜索的可扩展算法
7. Efficient Algorithms for Counting and Reporting Pairwise Intersections between Convex Polygons [O] . Prosenjit Gupta, Ravi Janardan, Michiel Smid 1996

机译：用于计算和报告凸多边形之间的成对交点的有效算法
8. Algorithms for Reporting and Counting Geometric Intersections. [R] . bentley,jon l. ottmann,th. 1978

机译：报告和计算几何交叉点的算法。

Comments on “algorithms for reporting and counting geometric intersections”

摘要

著录项

相似文献

相关主题

期刊订阅