Algorithms in Combinatorial Geometry.

1989 ◽  
Vol 96 (5) ◽  
pp. 457
Author(s):  
Jacob E. Goodman ◽  
Herbert Edelsbrunner

Author(s):  
Vladimir G. Boltjansky ◽  
Israel Gohberg






2021 ◽  
Vol 182 ◽  
pp. 105465
Author(s):  
Sherry Sarkar ◽  
Alexander Xue ◽  
Pablo Soberón


2021 ◽  
Author(s):  
Thomas A. Plick




Author(s):  
Hallard T. Croft ◽  
Kenneth J. Falconer ◽  
Richard K. Guy


2000 ◽  
Vol 10 (03) ◽  
pp. 227-266 ◽  
Author(s):  
SHANG-HUA TENG ◽  
CHI WAI WONG

Mesh generation is a great example of inter-disciplinary research. Its development is built upon advances in computational and combinatorial geometry, data structures, numerical analysis, and scientific applications. Its success is justified not only by mathematical proofs about the quality and the numerical relevancy of geometry-based meshing algorithms, but also by the performance of meshing software in real applications. It embraces both provably good algorithms and practical heuristics. This paper presents a brief overview of algorithms, theorems, and software in mesh generation.



Author(s):  
Vladimir Boltyanski ◽  
Horst Martini ◽  
Petru S. Soltan


Sign in / Sign up

Export Citation Format

Share Document