Beichl, I.
and Sullivan, F.
(1998),
Interleave in Peace, or Interleave in Pieces, IEEE Computing in Science and Engineering
(Accessed May 9, 2025)
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
Secure .gov websites use HTTPS
A lock (
) or https:// means you’ve safely connected to the .gov website. Share sensitive information only on official, secure websites.
Interleave in Peace, or Interleave in Pieces
Published
Author(s)
,
Abstract
Bit interleaving is a technique that sometimes can collapse a problem of high-dimensional data to one of lower dimensional data. Our favorite use is going from two or three dimensions to one dimension. Of course, you lose something in this process because 2D is not the same as 1D. There is no reasonable one-to-one onto mapping between the two spaces. But sometimes, what you lose isn t all that important, and what you gain may make it worth doing. We will show how we have used bit interleaving for two applications: finding the Hausdorff distance between sets (approximately) and calculating capacity dimension. We welcome readers to write to us about other uses they may have found.Citation
IEEE Computing in Science and Engineering
Volume
5
Issue
No. 2
Pub Type
Journals
Keywords
bit interleaving, computational geometry, data compression, image analysis
Citation
Issues
If you have any questions about this publication or are having problems accessing it, please contact reflib@nist.gov.
Created September 1, 1998, Updated February 17, 2017