Sciweavers

5210 search results - page 273 / 1042
» Exact geometric computation
Sort
View
SMA
2006
ACM
136views Solid Modeling» more  SMA 2006»
16 years 18 days ago
Controlled-topology filtering
Many applications require the extraction of isolines and isosurfaces from scalar functions defined on regular grids. These scalar functions may have many different origins: from ...
Yotam I. Gingold, Denis Zorin
COMPGEOM
2010
ACM
15 years 11 months ago
Adding one edge to planar graphs makes crossing number hard
A graph is near-planar if it can be obtained from a planar graph by adding an edge. We show that it is NP-hard to compute the crossing number of near-planar graphs. The main idea ...
Sergio Cabello, Bojan Mohar
SIGGRAPH
1996
ACM
15 years 10 months ago
The Lumigraph
This paper discusses a new method for capturing the complete appearanceof both synthetic and realworld objects andscenes,representing this information, and then using this represe...
Steven J. Gortler, Radek Grzeszczuk, Richard Szeli...
196
Voted
ICRA
1995
IEEE
167views Robotics» more  ICRA 1995»
15 years 10 months ago
Modeling of Linear Objects Considering Bend, Twist, and Extensional Deformations
A systematic approach to the modeling of deformable ne linear objects is presented. Various deformable objects are manipulated in many manufacturing processes. Deformation of the...
Hidefumi Wakamatsu, Shinichi Hirai, Kazuaki Iwata
TOG
2008
143views more  TOG 2008»
15 years 6 months ago
Discovering structural regularity in 3D geometry
We introduce a computational framework for discovering regular or repeated geometric structures in 3D shapes. We describe and classify possible regular structures and present an e...
Mark Pauly, Niloy J. Mitra, Johannes Wallner, Helm...