Sciweavers

4850 search results - page 392 / 970
» Proof and Computation in Geometry
Sort
View
COMPGEOM
1995
ACM
15 years 10 months ago
How Good are Convex Hull Algorithms?
A convex polytope P can be speci ed in two ways: as the convex hull of the vertex set V of P, or as the intersection of the set H of its facet-inducing halfspaces. The vertex enum...
David Avis, David Bremner
179
Voted
SMA
2010
ACM
181views Solid Modeling» more  SMA 2010»
15 years 7 months ago
Merging and smoothing machining boundaries on cutter location surfaces
In region machining, neighbouring regions may be close together, but disconnected. Boundary curves may also have unwanted geometric artifacts caused by approximation and discretis...
Weishi Li, Ralph R. Martin, Frank C. Langbein
173
Voted
SMA
2008
ACM
286views Solid Modeling» more  SMA 2008»
15 years 6 months ago
Controlled field generation for quad-remeshing
Quadrangular remeshing of triangulated surfaces has received an increasing attention in recent years. A particularly elegant approach is the extraction of quads from the streamlin...
Oliver Schall, Rhaleb Zayer, Hans-Peter Seidel
184
Voted
CAD
2004
Springer
15 years 6 months ago
Teaching meshes, subdivision and multiresolution techniques
In recent years, geometry processing algorithms that directly operate on polygonal meshes have become an indispensable tool in computer graphics, CAD/CAM applications, numerical s...
Stephan Bischoff, Leif Kobbelt
VC
2008
167views more  VC 2008»
15 years 6 months ago
A framework for GPU-based application-independent 3D interactions
Abstract Direct manipulation using pointing devices commonly relies on basic interaction tasks such as selection and precise cursor positioning. Traditionally, such tasks use geome...
Harlen Costa Batagelo, Shin-Ting Wu