Result 1 to 20 of 262 total
Frontiers in algorithmics and algorithmic aspects in information and management. Joint international conference, FAW-AAIM 2012, Beijing, China, May 14‒16, 2012. Proceedings. (English)
Lecture Notes in Computer Science 7285. Berlin: Springer (ISBN 978-3-642-29699-4/pbk). xvii, 370~p. \$~95.00 (2012).
1
Reconstructing polygons from scanner data. (English)
Theor. Comput. Sci. 412, No. 32, 4161-4172 (2011).
2
Degree-driven design for correct geometric algorithms. (English)
Atallah, Mikhail (ed.) et al., Frontiers in algorithmics and algorithmic aspects in information and management. Joint international conference, FAW-AAIM 2011, Jinhua, China, May 28‒31, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-21203-1/pbk). Lecture Notes in Computer Science 6681, 8-9 (2011).
3
Almost all Delaunay triangulations have stretch factor greater than $π/2$. (English)
Comput. Geom. 44, No. 2, 121-127 (2011).
4
Degree-driven design for correct geometric algorithms (English)
FAW-AAIM, 8-9 (2011).
5
Fitting spheres to electron density (English)
Symposium on Computational Geometry, 291-292 (2011).
6
The dilation of the Delaunay triangulation is greater than $π/2$. (English)
Comput. Res. Repos. 2010, Article No. 1006.0291 (2010).
7
Computation of non-dominated points using compact Voronoi diagrams. (English)
Rahman, Md. Saidur (ed.) et al., WALCOM: Algorithms and computation. 4th international workshop, WALCOM 2010, Dhaka, Bangladesh, February 10‒12, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-11439-7/pbk). Lecture Notes in Computer Science 5942, 82-93 (2010).
8
Delaunay triangulation of imprecise points in linear time after preprocessing. (English)
Comput. Geom. 43, No. 3, 234-242 (2010).
9
Flexible isosurfaces: Simplifying and displaying scalar topology using the contour tree. (English)
Comput. Geom. 43, No. 1, 42-58 (2010).
10
Implementing streaming simplification for large labeled meshes (English)
ALENEX, 149-158 (2010).
11
Computing planar Voronoi diagrams in double precision: a further example of degree-driven algorithm design (English)
Symposium on Computational Geometry, 386-392 (2010).
12
Maximum geodesic routing in the plane with obstacles (English)
CCCG, 107-108 (2010).
13
Computation of non-dominated points using compact Voronoi diagrams (English)
WALCOM, 82-93 (2010).
14
Proceedings of the 26th ACM symposium on computational geometry, snowbird, Utah, USA, June 13-16, 2010 (English)
Symposium on Computational Geometry (2010).
15
On finding non-dominated points using compact Voronoi diagrams. (English)
Comput. Res. Repos. 2009, Article No. 0909.0814 (2009).
16
Reconstructing polygons from scanner data. (English)
Dong, Yingfei (ed.) et al., Algorithms and computation. 20th international symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16‒18, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-10630-9/pbk). Lecture Notes in Computer Science 5878, 862-871 (2009).
17
Isocontour based visualization of time-varying scalar fields. (English)
Möller, Torsten (ed.) et al., Mathematical foundations of scientific visualization, computer graphics, and massive data exploration. Papers based on the presentations at the workshop, Banff, Canada, May 22‒27, 2004. Berlin: Springer (ISBN 978-3-540-25076-0/hbk; 978-3-540-49926-8/ebook). Mathematics and Visualization, 41-68 (2009).
18
Computing the implicit Voronoi diagram in triple precision. (English)
Dehne, Frank (ed.) et al., Algorithms and data structures. 11th international symposium, WADS 2009, Banff, Canada, August 21‒23, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-03366-7/pbk). Lecture Notes in Computer Science 5664, 495-506 (2009).
19
Identification of family-specific residue packing motifs and their use for structure-based protein function prediction: I. Method development (English)
Journal of Computer-Aided Molecular Design 23, No. 11, 773-784 (2009).
20
Result 1 to 20 of 262 total
Start
Contact
Print
General Help
