Sciweavers

459 search results - page 30 / 92
» Delaunay mesh construction
Sort
View
COMPGEOM
1993
ACM
13 years 11 months ago
A Linear-Time Randomized Algorithm for the Bounded Voronoi Diagram of a Simple Polygon
For a polygon P, the bounded Voronoi diagram of P is a partition of P into regions assigned to the vertices of P. A point p inside P belongs to the region of a vertex v if and onl...
Rolf Klein, Andrzej Lingas
CCCG
2003
13 years 9 months ago
Estimation of the necessary number of points in Riemannian Voronoi
G. Leibon and D. Letscher showed that for general and sufficiently dense point set its Delaunay triangulation and Voronoi diagram in Riemannian manifold exist. They also proposed ...
Kensuke Onishi, Jin-ichi Itoh

Source Code
9636views
15 years 8 months ago
2D-3D Automatic Mesh Generation
NETGEN is an open source automatic mesh generation tool for two and three dimensions. It comes as a stand alone program with graphical user interface, or as a C++ library to be lin...
Joachim Schöberl
GRAPHITE
2005
ACM
14 years 1 months ago
View-dependent tetrahedral meshing and rendering
We present a meshing and rendering framework for tetrahedral meshes that constructs a multi-resolution representation and uses this representation to adapt the mesh to rendering p...
Ralf Sondershaus, Wolfgang Straßer
ICCAD
2010
IEEE
158views Hardware» more  ICCAD 2010»
13 years 5 months ago
Novel binary linear programming for high performance clock mesh synthesis
Clock mesh is popular in high performance VLSI design because it is more robust against variations than clock tree at a cost of higher power consumption. In this paper, we propose ...
Minsik Cho, David Z. Pan, Ruchir Puri