Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
A digital analogue of the Jordan curve theorem
Šlapal J. Discrete Applied Mathematics139 (1-3):231-251,2004.Type:Article
Date Reviewed: Jul 19 2004

Digital topology is an important tool in computer graphics and image processing. Until the work of Khalimsky et al. in the early 1990s, it was mainly an ad hoc affair, using graph-theoretic techniques; Khalimsky and his coauthors, in their many papers, introduced techniques from abstract topology restricted to the set of points in the real plane having integer coordinates.

This paper takes the abstract approach a step further, by using a weakened version of Kuratowski closure operations to define a generalization of classical topologies more suitable to this setting, and sophisticated enough to prove an analog of the Jordan curve theorem (JCT) (the classical JCT says that every simple closed curve divides the real plane into precisely two components: an “inside” and an “outside”).

The paper is highly mathematical, and does not go into specific applications in computer science.

Reviewer:  Jonathan Golan Review #: CR129893 (0501-0064)
Bookmark and Share
  Reviewer Selected
 
 
Computations In Finite Fields (F.2.1 ... )
 
 
Digitizing And Scanning (I.3.3 ... )
 
 
Geometrical Problems And Computations (F.2.2 ... )
 
 
Nonnumerical Algorithms And Problems (F.2.2 )
 
 
Picture/ Image Generation (I.3.3 )
 
Would you recommend this review?
yes
no
Other reviews under "Computations In Finite Fields": Date
Some remarks on orders of projective planes, planar difference sets and multipliers
Ho C. Designs, Codes and Cryptography 1(1): 69-75, 1991. Type: Article
Aug 1 1992
The discrete logarithm hides O(log n) bits
Long D., Wigderson A. SIAM Journal on Computing 17(2): 363-372, 1988. Type: Article
May 1 1989
Multiplicative complexity of polynomial multiplication over finite fields
Kaminski M., Bshouty N. Journal of the ACM 36(1): 150-170, 1989. Type: Article
Sep 1 1989
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy