2 citations · 4 across the 4 of their papers we have counts for
Showing 2013Show all
2 papers · 1 filter
cs.CG2013★ 2 cited
A Note on the Unsolvability of the Weighted Region Shortest Path Problem
Jean-Lou De Carufel, Carsten Grimm, Anil Maheshwari +2
Let S be a subdivision of the plane into polygonal regions, where each region has an associated positive weight. The weighted region shortest path problem is to determine a shortes…
cs.CG2013★ 1 cited
Network Farthest-Point Diagrams
Prosenjit Bose, Kai Dannies, Jean-Lou De Carufel +5
Consider the continuum of points along the edges of a network, i.e., an undirected graph with positive edge weights. We measure distance between these points in terms of the shorte…