Smooth paths in a polygonal channel

Authors:
David Lutterkort;Jörg Peters
Affiliations:
Dept. of Computer Science, Purdue University, Westlafayette, IN;Department of Computer and Information Science, CSE Room 326, University of Florida, Gainesville, FL
Venue:
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
Year:
1999

Subdivision algorithms converge quadratically

Journal of Computational and Applied Mathematics
Computational geometry: algorithms and applications

Computational geometry: algorithms and applications
A path router for graph drawing

Proceedings of the fourteenth annual symposium on Computational geometry

SLEVEs for planar spline curves

Computer Aided Geometric Design
Curvature-bounded traversals of narrow corridors

SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
A non-trigonometric, pseudo area preserving, polyline smoothing algorithm

Journal of Computing Sciences in Colleges
Drawing graphs with GLEE

GD'07 Proceedings of the 15th international conference on Graph drawing
Approximating minimum bending energy path in a simple corridor

Computational Geometry: Theory and Applications

Hi-index	0.00