Sciweavers

11 search results - page 2 / 3
» Arithmetic Discrete Planes Are Quasicrystals
Sort
View
COMPGEOM
1990
ACM
13 years 8 months ago
Finding Compact Coordinate Representations for Polygons and Polyhedra
Practical solid modeling systems are plagued by numerical problems that arise from using oatingpoint arithmetic. For example, polyhedral solids are often represented by a combinat...
Victor Milenkovic, Lee R. Nackman
ICIP
2000
IEEE
13 years 9 months ago
Low-Complexity Scalable DCT Image Compression
We have developed a scalable image compression scheme with a good performance-complexity trade-off. Like JPEG, it is based on the 8 × 8 block discrete cosine transform (DCT), but...
René J. van der Vleuten, Richard P. Kleihor...
ISCAS
2002
IEEE
190views Hardware» more  ISCAS 2002»
13 years 9 months ago
A high performance JPEG2000 architecture
—JPEG2000 is an upcoming compression standard for still images that has a feature set well tuned for diverse data dissemination. These features are possible due to adaptation of ...
Kishore Andra, Chaitali Chakrabarti, Tinku Acharya
CORR
2010
Springer
143views Education» more  CORR 2010»
13 years 4 months ago
The Complexity of Proving the Discrete Jordan Curve Theorem
The Jordan Curve Theorem (JCT) states that a simple closed curve divides the plane into exactly two connected regions. We formalize and prove the theorem in the context of grid gr...
Phuong Nguyen, Stephen Cook
COMPGEOM
2003
ACM
13 years 10 months ago
Controlled perturbation for arrangements of circles
Given a collection C of circles in the plane, we wish to construct the arrangement A(C) (namely the subdivision of the plane into vertices, edges and faces induced by C) using fl...
Dan Halperin, Eran Leiserowitz