维普期刊资源整合服务平台（V6.5）

维普中文期刊产品整合服务

5篇 您的检索式：作者名="David Eppstein"

选中清除导出查看参考文献查看引证文献引用追踪共1页首页上一页第1页下一页末页 /1 跳转

		题名	作者	年代	出处	被引量
	1	On 2-Site Voronoi Diagrams Under Geometric Distance Functions显示文摘We revisit a new type of Voronoi diagram, in which distance is measured from a point to a pair of points. We consider a few more such distance functions, based on geometric primitives, namely, circles and triangles, and analyze the structure and complexity of the nearest- and furthest-neighbor 2-site Voronoi diagrams of a point set in the plane with respect to these distance functions. In addition, we bring to notice that 2-point site Voronoi diagrams can be alternatively interpreted as 1-site Voronoi diagrams of segments, and thus, our results also enhance the knowledge on the latter.	Gill Barequet Matthew Dickerson David Eppstein David Hodorkovsky Kira Vyatkina	2013	Journal of Computer Science & Technology2013，28，2：	2
	2	Finding the k shortest paths 显示文摘	David Eppstein	1999	SIAM Journal on Computing1999，28，2：	1
	3	Finding the k shortest paths显示文摘	David Eppstein	1998	SIAM Journal on Computing1998，28，2：	1
	4	Finding the k shortest paths显示文摘	David Eppstein	1998	SIAM Journal on Computing1998，28，：	1
	5	Optimal point placement for mesh smoothing 显示文摘	Amenta Nina Marshall Bern David Eppstein	1999	Journal of Algorithms1999，30，2：	1

返回顶部每页显示：

共1页首页上一页第1页下一页末页 /1 跳转

goolge学术搜索-维普

网站首页 | 关于我们 | 联系我们 | 产品服务 | 客服中心 | 广告服务 | 版权声明 | 网站联盟 | 友情链接 | 售卡网点

版权所有© 渝B2-20050021-1　渝公网安备 50019002500403号　违法和不良信息举报中心

互联网出版许可证新出网证(渝)字10号全国400电话 - 免长途话费