Sciweavers

256 search results - page 6 / 52
» Short trees in polygons
Sort
View
EJC
2008
13 years 8 months ago
Dyck paths with coloured ascents
We introduce a notion of Dyck paths with coloured ascents. For several ways of colouring, when the set of colours is itself some class of lattice paths, we establish bijections be...
Andrei Asinowski, Toufik Mansour
WSCG
2004
170views more  WSCG 2004»
13 years 10 months ago
An Image-Based Multiresolution Model for Interactive Foliage Rendering
This paper presents a new method for realistic real-time rendering of tree foliage. Some approaches to this problem have been presented before but the quality of their results was...
Javier Lluch, Emilio Camahort, Roberto Vivó
CAGD
2005
130views more  CAGD 2005»
13 years 8 months ago
Truly selective polygonal mesh hierarchies with error control
In this work a new multi-resolution model is proposed for polygonal meshes. It is based on the dual edge collapse, which performs face clustering instead of vertex clustering. The...
Stefan Gumhold
RECOMB
2009
Springer
14 years 3 months ago
Phylogenies without Branch Bounds: Contracting the Short, Pruning the Deep
Abstract Constantinos Daskalakis1 , Elchanan Mossel2, , and Sebastien Roch1 1 Microsoft Research 2 UC Berkeley and Weizman Institute We introduce a new phylogenetic reconstruction ...
Constantinos Daskalakis, Elchanan Mossel, Sé...
RT
1997
Springer
14 years 22 days ago
Incremental Updates to Scenes Illuminated by Area Light Sources
Abstract: An object space algorithm for computing shadows in dynamic scenes illuminated by area light sources is presented. A mesh with the shadow boundaries as well as other disco...
Yiorgos Chrysanthou, Mel Slater