4.5 Article Proceedings Paper

On Landmark Distances in Polygons

相关参考文献

注意:仅列出部分参考文献,下载原文获取全部文献信息。
Article Computer Science, Software Engineering

Path planning with divergence-based distance functions

Renjie Chen et al.

COMPUTER AIDED GEOMETRIC DESIGN (2018)

Article Computer Science, Software Engineering

Efficient Path Generation with Reduced Coordinates

Renjie Chen et al.

COMPUTER GRAPHICS FORUM (2018)

Article

Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions

Martin Nöllenburg et al.

INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS (2017)

Article Computer Science, Software Engineering

Geodesics in Heat: A New Approach to Computing Distance Based on Heat Flow

Keenan Crane et al.

ACM TRANSACTIONS ON GRAPHICS (2013)

Article Computer Science, Theory & Methods

The Geodesic Diameter of Polygonal Domains

Sang Won Bae et al.

DISCRETE & COMPUTATIONAL GEOMETRY (2013)

Article Computer Science, Hardware & Architecture

Greedy Geographic Routing in Large-Scale Sensor Networks: A Minimum Network Decomposition Approach

Guang Tan et al.

IEEE-ACM TRANSACTIONS ON NETWORKING (2012)

Article Computer Science, Software Engineering

Fast exact and approximate geodesics on meshes

V Surazhsky et al.

ACM TRANSACTIONS ON GRAPHICS (2005)

Article Computer Science, Theory & Methods

Online routing in triangulations

P Bose et al.

SIAM JOURNAL ON COMPUTING (2004)