Computational geometry: an introduction
Computational geometry: an introduction
Applications of random sampling in computational geometry, II
Discrete & Computational Geometry - Selected papers from the fourth ACM symposium on computational geometry, Univ. of Illinois, Urbana-Champaign, June 6 8, 1988
Fitting polygonal functions to a set of points in the plane
CVGIP: Graphical Models and Image Processing
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Range searching with efficient hierarchical cuttings
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Discrete & Computational Geometry - Special issue on ACM symposium on computational geometry, North Conway
Ray shooting and parametric search
SIAM Journal on Computing
ACM Computing Surveys (CSUR)
Handbook of discrete and computational geometry
Notes on computing peaks in k-levels and parametric spanning trees
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
AAIM'06 Proceedings of the Second international conference on Algorithmic Aspects in Information and Management
| Hi-index | 0.00 |
Fitting a curve of a certain type to a given set of points in the plane is a basic problem in statistics and has numerous applications We consider fitting a polyline with k joints under the min-sum criteria with respect to L1- and L2-metrics, which are more appropriate measures than uniform and Hausdorff metrics in statistical context We present efficient algorithms for the 1-joint versions of the problem, and fully polynomial-time approximation schemes for the general k-joint versions.