|
Volumn 35, Issue 11, 2002, Pages 2539-2548
|
Efficient algorithms for 3-D polygonal approximation based on LISE criterion
|
Author keywords
3 D polygonal approximation; Algorithms; Dynamic programming; Integral square error criterion; Sampling technique; Shortest path
|
Indexed keywords
ALGORITHMS;
APPROXIMATION THEORY;
ERRORS;
POLYGONAL SEGMENTS;
PATTERN RECOGNITION;
ALGORITHM;
|
EID: 0036833286
PISSN: 00313203
EISSN: None
Source Type: Journal
DOI: 10.1016/S0031-3203(01)00226-6 Document Type: Article |
Times cited : (6)
|
References (21)
|