Filtered Computation
Filtered Computation is a computational paradigm in robust geometric computation that belongs to the class of hybrid numerical evaluation techniques, distinguished by its use of fast approximate arithmetic as a preliminary filter to avoid expensive exact computations whenever possible.
10
Publications
380
Citations
33
Authors
20
Institutions
Publications per year
2017–2026
1
Parents
10
Digital filtering using logarithmic arithmetic
N. Kingsbury, P. J. Rayner · Electronics Letters · 1971 · 147 citations
Engineering, Computer Engineering, Electrical Engineering +13
Efficient Exact Geometric Predicates for Delaunay Triangulations
Olivier Devillers, Sylvain Pion · 2003 · 29 citations · Full text
1–5 of 10
33
1
h-index
1
h-index
1
h-index
1
h-index
1
h-index
1–5 of 33
20
Max Planck Institute for Informatics
Saarbrücken, Germany
1 h-index
3 publications
72 citations
University of Wuppertal
Wuppertal, Germany
1 h-index
1 publications
39 citations

University of Notre Dame
Notre Dame, United States
1 h-index
1 publications
18 citations
Stanford University
Stanford, United States
1 h-index
2 publications
36 citations

University of Waterloo
Waterloo, Canada
1 h-index
1 publications
38 citations
Institute for Informatics and Automation Problems
Yerevan, Armenia
1 h-index
4 publications
156 citations
University of Cambridge
Cambridge, United Kingdom
1 h-index
2 publications
294 citations
Southern Methodist University
Dallas, United States
1 h-index
1 publications
14 citations
1–8 of 20
1 publications · 39 citations
1
h-index
1 publications · 16 citations
1
h-index
IJCGA · 1 publications · 24 citations
1
h-index
JHEP · 1 publications · 39 citations
1
h-index
1 publications · 16 citations
1
h-index
1–5