Result 1 to 15 of 15 total
Farthest-polygon Voronoi diagrams. (English)
Comput. Geom. 44, No. 4, 234-247 (2011).
1
Coherent parallel hashing (English)
ACM Trans. Graph. 30, No. 6, 161 (2011).
2
Farthest-polygon Voronoi diagrams. (English)
Comput. Res. Repos. 2010, Article No. 1001.3593 (2010).
3
By-example synthesis of architectural textures (English)
ACM Trans. Graph. 29, No. 4 (2010).
4
Incremental construction of the Delaunay triangulation and the Delaunay graph in medium dimension (English)
Symposium on Computational Geometry, 208-216 (2009).
5
Farthest-polygon Voronoi diagrams. (English)
Arge, Lars (ed.) et al., Algorithms ‒ ESA 2007. 15th annual European symposium, Eilat, Israel, October 8‒10, 2007, Proceedings. Berlin: Springer (ISBN 978-3-540-75519-7/pbk). Lecture Notes in Computer Science 4698, 407-418 (2007).
6
Maintaining visibility information of planar point sets with a moving viewpoint. (English)
Int. J. Comput. Geom. Appl. 17, No. 4, 297-304 (2007).
7
Farthest-polygon Voronoi diagrams (English)
ESA, 407-418 (2007).
8
Texture sprites: texture elements splatted on surfaces (English)
SI3D, 163-170 (2005).
9
{\it ZP}+: correct {\it Z-pass} stencil shadows (English)
SI3D, 195-202 (2005).
10
Maintaining visibility information of planar point sets with a moving viewpoint (English)
CCCG, 302-305 (2005).
11
Implicit modeling using subdivision curves. (English)
Visual Comput. 19, No. 2-3, 94-104 (2003).
12
On solving temporal logic queries. (English)
Kirchner, Hélène (ed.) et al., Algebraic methodology and software technology. 9th international conference, AMAST 2002, Saint-Gilles-les-Bains, Reunion Island, France, September 9‒13, 2002. Prodeedings. Berlin: Springer (ISBN 3-540-44144-1/pbk). Lecture Notes in Computer Science 2422, 163-177 (2002).
13
On solving temporal logic queries (English)
AMAST, 163-177 (2002).
14
Subdivision-curve primitives: A new solution for interactive implicit modeling (English)
Shape Modeling International, 82-88 (2001).
15
Result 1 to 15 of 15 total