Sciweavers

1018 search results - page 96 / 204
» Property Testing in Computational Geometry
Sort
View
EUROGRAPHICS
2010
Eurographics
14 years 7 months ago
Isosurfaces Over Simplicial Partitions of Multiresolution Grids
We provide a simple method that extracts an isosurface that is manifold and intersection-free from a function over an arbitrary octree. Our method samples the function dual to min...
Josiah Manson and Scott Schaefer
SIGGRAPH
1993
ACM
14 years 2 months ago
Adaptive display algorithm for interactive frame rates during visualization of complex virtual environments
We describe an adaptive display algorithm for interactive frame rates during visualization of very complex virtual environments. The algorithm relies upon a hierarchical model rep...
Thomas A. Funkhouser, Carlo H. Séquin
TOG
2012
206views Communications» more  TOG 2012»
12 years 13 days ago
Beady: interactive beadwork design and construction
We introduce the interactive system “Beady” to assist the design and construction of customized 3D beadwork. The user first creates a polygonal mesh model called the design m...
Yuki Igarashi, Takeo Igarashi, Jun Mitani
ASPDAC
2006
ACM
141views Hardware» more  ASPDAC 2006»
14 years 1 months ago
Depth-driven verification of simultaneous interfaces
The verification of modern computing systems has grown to dominate the cost of system design, often with limited success as designs continue to be released with latent bugs. This t...
Ilya Wagner, Valeria Bertacco, Todd M. Austin
COMPGEOM
2009
ACM
14 years 4 months ago
Near-linear approximation algorithms for geometric hitting sets
Given a set system (X, R), the hitting set problem is to find a smallest-cardinality subset H ⊆ X, with the property that each range R ∈ R has a non-empty intersection with H...
Pankaj K. Agarwal, Esther Ezra, Micha Sharir