Sciweavers

64 search results - page 4 / 13
» Irreducible triangulations are small
Sort
View
TIT
2008
115views more  TIT 2008»
13 years 7 months ago
Affine Reflection Group Codes
This paper presents a construction of Slepian group codes from affine reflection groups. The solution to the initial vector and nearest distance problem is presented for all irred...
Terasan Niyomsataya, Ali Miri, Monica Nevins
ORL
2006
72views more  ORL 2006»
13 years 7 months ago
A note on two-person zero-sum communicating stochastic games
For undiscounted two-person zero-sum communicating stochastic games with finite state and action spaces, a solution procedure is proposed that exploits the communication property,...
Zeynep Müge Avsar, Melike Baykal-Gursoy
JAL
2006
114views more  JAL 2006»
13 years 7 months ago
A wide-range algorithm for minimal triangulation from an arbitrary ordering
We present a new algorithm, called LB-Triang, which computes minimal triangulations. We give both a straightforward O(nm0) time implementation and a more involved O(nm) time imple...
Anne Berry, Jean Paul Bordat, Pinar Heggernes, Gen...
COMPGEOM
2004
ACM
14 years 1 months ago
Sampling and meshing a surface with guaranteed topology and geometry
This paper presents an algorithm for sampling and triangulating a generic C2 -smooth surface Σ ⊂ R3 that is input with an implicit equation. The output triangulation is guarant...
Siu-Wing Cheng, Tamal K. Dey, Edgar A. Ramos, Tath...
COMPGEOM
2004
ACM
14 years 1 months ago
A 2D kinetic triangulation with near-quadratic topological changes
Given a set of n points S in the plane, a triangulation of S is a subdivision of the convex hull into triangles whose vertices are from S. In the kinetic setting, the input point ...
Pankaj K. Agarwal, Yusu Wang, Hai Yu