Sciweavers

346 search results - page 31 / 70
» On the sizes of Delaunay meshes
Sort
View
SOFSEM
2005
Springer
14 years 1 months ago
Outerplanar Crossing Numbers of 3-Row Meshes, Halin Graphs and Complete p-Partite Graphs
An outerplanar (also called circular, convex, one-page) drawing of an n-vertex graph G is a drawing in which the vertices are placed on a circle and each edge is drawn using one s...
Radoslav Fulek, Hongmei He, Ondrej Sýkora, ...
WADS
1993
Springer
115views Algorithms» more  WADS 1993»
13 years 11 months ago
Parallel Construction of Quadtrees and Quality Triangulations
We describe efficient PRAM algorithms for constructing unbalanced quadtrees, balanced quadtrees, and quadtree-based finite element meshes. Our algorithms take time O(log n) for p...
Marshall W. Bern, David Eppstein, Shang-Hua Teng
ICMCS
2008
IEEE
148views Multimedia» more  ICMCS 2008»
14 years 2 months ago
Loss tolerance scheme for 3D progressive meshes streaming over networks
– Nowadays, the Internet provides a convenient medium for sharing complex 3D models online. However, transmitting 3D progressive meshes over networks may encounter the problem of...
Hui Li, Ziying Tang, Xiaohu Guo, Balakrishnan Prab...
TCAD
1998
107views more  TCAD 1998»
13 years 7 months ago
Optimizing dominant time constant in RC circuits
— Conventional methods for optimal sizing of wires and transistors use linear resistor-capacitor (RC) circuit models and the Elmore delay as a measure of signal delay. If the RC ...
Lieven Vandenberghe, Stephen P. Boyd, Abbas A. El ...
CGF
2005
109views more  CGF 2005»
13 years 7 months ago
GeoFilter: Geometric Selection of Mesh Filter Parameters
When designing a lowpass filter to eliminate noise in a triangle mesh, the cutoff frequency is typically chosen by a cumbersome trial-and-error process. Therefore, it is important...
ByungMoon Kim, Jarek Rossignac