Skip to main content
Article thumbnail
Location of Repository

By 

Abstract

Abstract—Piecewise-linear approximation is an efficient solution to the problem of modeling the sampling dataset. But the approximation precision of the piecewise linear function has a close correlation with domain partition. In this paper, a triangle partition based construction algorithm is proposed, which uses the techniques similar to what had been applied for minimum weight triangulation problem. The most important characteristics of the algorithm are: we used feature point which is local maximum or local minimum point as the vertices of triangle and then choose each triangle greedily by criteria of minimizing l2-distance. By optimizing the positions of all triangular vertices, the proposed algorithms possess a better performance for adapting itself to a concrete approximation problem. As a result, the precision of PWL function defined on this partition is improved greatly. I

Year: 2009
OAI identifier: oai:CiteSeerX.psu:10.1.1.135.7898
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.ic-4.org/proceeding... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.