Tejel J

J Tejel

Information about the author J Tejel will soon be added to the site.
Found 2 papers in total
Computing a Hamiltonian Path of Minimum Euclidean Length Inside a Simple Polygon
2013
Given an n ‐vertex convex polygon, we show that a shortest Hamiltonian path...
Augmenting the Rigidity of a Graph in R2
2011
Given a Laman graph G , i.e. a minimally rigid graph in R 2 , we provide a Θ ( n...
Papers per page: