Sciweavers

115 search results - page 12 / 23
» Generating All Sets With Bounded Unions
Sort
View
CGF
2008
201views more  CGF 2008»
13 years 7 months ago
High-Resolution Volumetric Computation of Offset Surfaces with Feature Preservation
We present a new algorithm for the efficient and reliable generation of offset surfaces for polygonal meshes. The algorithm is robust with respect to degenerate configurations and...
Darko Pavic, Leif Kobbelt
SIGMOD
2001
ACM
213views Database» more  SIGMOD 2001»
14 years 7 months ago
Bit-Sliced Index Arithmetic
The bit-sliced index (BSI) was originally defined in [ONQ97]. The current paper introduces the concept of BSI arithmetic. For any two BSI's X and Y on a table T, we show how ...
Denis Rinfret, Patrick E. O'Neil, Elizabeth J. O'N...
LATA
2011
Springer
12 years 10 months ago
Networks of Evolutionary Processors with Subregular Filters
In this paper we propose a hierarchy of classes of languages, generated by networks of evolutionary processors with the filters in several special classes of regular sets. More p...
Jürgen Dassow, Florin Manea, Bianca Truthe
CG
2006
Springer
13 years 7 months ago
G-Strokes: A Concept for Simplifying Line Stylization
In most previous NPR line rendering systems, geometric properties have been directly used to extract and stylize certain edges. However, this approach is bound to a tight stylizat...
Tobias Isenberg, Angela Brennecke
EACL
2009
ACL Anthology
14 years 8 months ago
Parsing Mildly Non-Projective Dependency Structures
We present novel parsing algorithms for several sets of mildly non-projective dependency structures. First, we define a parser for well-nested structures of gap degree at most 1, ...
Carlos Gómez-Rodríguez, David J. Wei...