3575 search results - page 387 / 715 » Modeling Concurrency with Geometry |
181
click to vote
IMR
2004
Springer
16 years 25 days ago
2004
Springer
We present a method that computes a global potentially visible set for the complete region outside the convex hull of an object. The technique is used to remove invisible parts (t...
200
click to vote
IMR
2003
Springer
16 years 19 days ago
2003
Springer
The visualization of 3D vector and tensor fields in a 2D image is challenging because the large amount of information will either be mixed during projection to 2D or lead to seve...
178
Voted
COMPGEOM
2010
ACM
16 years 16 days ago
2010
ACM
We consider the problem of reconstructing a compact 3manifold (with boundary) embedded in R3 from its crosssections with a given set of cutting planes having arbitrary orientation...
184
Voted
COMPGEOM
2010
ACM
16 years 16 days ago
2010
ACM
Let G be an unweighted graph of complexity n cellularly embedded in a surface (orientable or not) of genus g. We describe improved algorithms to compute (the length of) a shortest...
176
Voted
VISUALIZATION
2002
IEEE
16 years 11 days ago
2002
IEEE
We present a method for interactive rendering of large outdoor scenes. Complex polygonal plant models and whole plant populations are represented by relatively small sets of point...