Sciweavers

1038 search results - page 102 / 208
» Boundary Points and Resolution
Sort
View
SMA
2003
ACM
163views Solid Modeling» more  SMA 2003»
15 years 6 months ago
Fast swept volume approximation of complex polyhedral models
We present an efficient algorithm to approximate the swept volume (SV) of a complex polyhedron along a given trajectory. Given the boundary description of the polyhedron and a pat...
Young J. Kim, Gokul Varadhan, Ming C. Lin, Dinesh ...
ICCAD
2009
IEEE
117views Hardware» more  ICCAD 2009»
14 years 11 months ago
Binning optimization based on SSTA for transparently-latched circuits
With increasing process variation, binning has become an important technique to improve the values of fabricated chips, especially in high performance microprocessors where transpa...
Min Gong, Hai Zhou, Jun Tao, Xuan Zeng
KDD
2002
ACM
155views Data Mining» more  KDD 2002»
16 years 1 months ago
SyMP: an efficient clustering approach to identify clusters of arbitrary shapes in large data sets
We propose a new clustering algorithm, called SyMP, which is based on synchronization of pulse-coupled oscillators. SyMP represents each data point by an Integrate-and-Fire oscill...
Hichem Frigui
CAD
2004
Springer
15 years 1 months ago
A shape design system using volumetric implicit PDEs
Solid modeling based on partial differential equations (PDEs) can potentially unify both geometric constraints and functional requirements within a single design framework to mode...
Haixia Du, Hong Qin
111
Voted
PG
2007
IEEE
15 years 7 months ago
Visualisation of Implicit Algebraic Curves
We describe a new algorithm for the visualisation of implicit algebraic curves, which isolates the singular points, compute the topological degree around these points in order to ...
Lionel Alberti, Bernard Mourrain