A Linear Bound on the Complexity of the Delaunay Triangulation of Points on Polyhedral Surfaces-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

A Linear Bound on the Complexity of the Delaunay Triangulation of Points on Polyhedral Surfaces

Published:2004-02-01 Issue:3 Volume:31 Page:369-384
ISSN:0179-5376
Container-title:Discrete and Computational Geometry
language:
Short-container-title:Discrete and Computational Geometry

Author:

Attali Dominique,Boissonnat Jean-Daniel

Publisher

Springer Science and Business Media LLC

Subject

Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Geometry and Topology,Theoretical Computer Science

Link

http://link.springer.com/content/pdf/10.1007/s00454-003-2870-4.pdf

Cited by 31 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Randomized Incremental Construction of Delaunay Triangulations of Nice Point Sets;Discrete & Computational Geometry;2020-09-08

2. Uncorrelated Geo-Text Inhibition Method Based on Voronoi K-Order and Spatial Correlations in Web Maps;ISPRS International Journal of Geo-Information;2020-06-09

3. Randomized Incremental Construction of Delaunay Triangulations of Nice Point Sets;LEIBNIZ INT PR INFOR;2019

4. Voxel cores;ACM Transactions on Graphics;2018-08-31

5. Consistency method for measurements of the support function of a convex body in the metric of L∞;Moscow University Mathematics Bulletin;2017-07

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP