Author of the publication

Polyline Fitting of Planar Points under Min-sum Criteria.

, , , , and . Int. J. Comput. Geom. Appl., 16 (2-3): 97-116 (2006)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Online graph exploration algorithms for cycles and trees by multiple searchers., , , and . J. Comb. Optim., 28 (2): 480-495 (2014)Minsum k-Sink Problem on Path Networks., , , , and . CoRR, (2018)Covering Points in the Plane by k-Tours: Towards a Polynomial Time Approximation Scheme for General k., , , and . STOC, page 275-283. ACM, (1997)On the Infinitesimal Rigidity of Bar-and-Slider Frameworks., and . ISAAC, volume 5878 of Lecture Notes in Computer Science, page 524-533. Springer, (2009)A Polynomial-Time Algorithm for the Universally Quickest Transshipment Problem in a Certain Class of Dynamic Networks with Uniform Path-Lengths., and . ISAAC, volume 5878 of Lecture Notes in Computer Science, page 802-811. Springer, (2009)A Study of the LMT-Skeleton., , and . ISAAC, volume 1178 of Lecture Notes in Computer Science, page 256-265. Springer, (1996)Number Theory Helps Line Detection in Digital Images., and . ISAAC, volume 762 of Lecture Notes in Computer Science, page 313-322. Springer, (1993)A Rooted-Forest Partition with Uniform Vertex Demand., and . WALCOM, volume 5942 of Lecture Notes in Computer Science, page 179-190. Springer, (2010)Minimax Regret 1-Sink Location Problems in Dynamic Path Networks., , , , , and . TAMC, volume 7876 of Lecture Notes in Computer Science, page 121-132. Springer, (2013)Online Exploration of All Vertices in a Simple Polygon., and . FAW-AAIM, volume 7285 of Lecture Notes in Computer Science, page 315-326. Springer, (2012)