Error-bounded Simplification
Error-Bounded Simplification is a geometric simplification technique that reduces the complexity of a model while guaranteeing that the deviation between the original and simplified representation remains within a specified tolerance threshold.
15
Publications
611
Citations
44
Authors
25
Institutions
Publications per year
2017–2026
5
Parents
15
Near-Linear Time Approximation Algorithms for Curve Simplification
Pankaj K. Agarwal, Sariel Har-Peled, Nabil H. Mustafa et al. · Algorithmica · 2005 · 98 citations
Steve Zelinka, Michael Garland · ACM Transactions on Graphics · 2002 · 39 citations
1–5 of 15
44
2
h-index
2
h-index
1
h-index
1
h-index
1
h-index
1–5 of 44
25
University of Illinois Urbana-Champaign
Urbana, United States
3 h-index
5 publications
396 citations

University of Hong Kong
Pok Fu Lam, Hong Kong
2 h-index
3 publications
62 citations
Utrecht University
Utrecht, The Netherlands
2 h-index
3 publications
87 citations
National United University
Miaoli, Taiwan
1 h-index
2 publications
46 citations
University of Pittsburgh
Pittsburgh, United States
1 h-index
1 publications
24 citations
The University of Texas at Dallas
Richardson, United States
1 h-index
1 publications
21 citations
The University of Texas at Austin
Austin, United States
1 h-index
1 publications
80 citations
Chinese University of Hong Kong
Hong Kong, Hong Kong
1 h-index
1 publications
20 citations
1–8 of 25
2 publications · 106 citations
2
h-index
TOG · 2 publications · 149 citations
2
h-index
1 publications · 23 citations
1
h-index
1 publications · 15 citations
1
h-index
1 publications · 98 citations
1
h-index
1–5