- CSB - MetaPress - Google - Bing - Yahoo
 | 2010 | |
|---|---|---|
| j26 |      | Laurence Boxer, Ismet Karaca: Some Properties of Digital Covering Spaces. Journal of Mathematical Imaging and Vision 37(1): 17-26 (2010) |
| 2009 | ||
| j25 | | Laurence Boxer: Efficient Coarse Grained Permutation Exchanges and Matrix Multiplication. Parallel Processing Letters 19(3): 477-484 (2009) |
| 2008 | ||
| j24 | | Laurence Boxer, Ismet Karaca: The Classification of Digital Covering Spaces. Journal of Mathematical Imaging and Vision 32(1): 23-29 (2008) |
| 2007 | ||
| j23 | | Laurence Boxer: Fundamental Groups of Unbounded Digital Images. Journal of Mathematical Imaging and Vision 27(2): 121-127 (2007) |
| 2006 | ||
| j22 | | Laurence Boxer: Homotopy Properties of Sphere-Like Digital Images. Journal of Mathematical Imaging and Vision 24(2): 167-175 (2006) |
| j21 | | Laurence Boxer: Digital Products, Wedges, and Covering Spaces. Journal of Mathematical Imaging and Vision 25(2): 159-171 (2006) |
| 2005 | ||
| j20 | | Laurence Boxer: Properties of Digital Homotopy. Journal of Mathematical Imaging and Vision 22(1): 19-26 (2005) |
| c2 |  | |
| 2004 | ||
| j19 | | Laurence Boxer, Russ Miller: Coarse grained gather and scatter operations with applications. J. Parallel Distrib. Comput. 64(11): 1297-1310 (2004) |
| 2002 | ||
| j18 | | Laurence Boxer, Russ Miller: Corrigendum to "Efficient Computation of the Euclidean Distance Transform". Computer Vision and Image Understanding 86(2): 137-140 (2002) |
| 2000 | ||
| j17 | | Laurence Boxer, Russ Miller: Efficient Computation of the Euclidean Distance Transform. Computer Vision and Image Understanding 80(3): 379-383 (2000) |
| 1999 | ||
| j16 | | Laurence Boxer: A Classical Construction for the Digital Fundamental Group. Journal of Mathematical Imaging and Vision 10(1): 51-62 (1999) |
| j15 | | Laurence Boxer, Russ Miller, Andrew Rau-Chaplin: Scalable Parallel Algorithms for Geometric Pattern Recognition. J. Parallel Distrib. Comput. 58(3): 466-486 (1999) |
| 1998 | ||
| j14 | | Laurence Boxer, Russ Miller, Andrew Rau-Chaplin: Scaleable Parallel Algorithms for Lower Envelopes with Applications. J. Parallel Distrib. Comput. 53(2): 91-118 (1998) |
| j13 | | Laurence Boxer: Faster point set pattern matching in 3-D. Pattern Recognition Letters 19(13): 1235-1240 (1998) |
| 1997 | ||
| j12 | | Laurence Boxer: On Hausdorff-like metrics for fuzzy sets. Pattern Recognition Letters 18(2): 115-118 (1997) |
| j11 | | Laurence Boxer: Corrigenda to "On Hausdorff-like metrics for fuzzy sets" [Pattern Recognition Lettes Vol. 18, (1997) 115-118]. Pattern Recognition Letters 18(5): 505-506 (1997) |
| 1996 | ||
| j10 | | Laurence Boxer: Point set pattern matching in 3-D. Pattern Recognition Letters 17(12): 1293-1297 (1996) |
| 1994 | ||
| j9 | | |
| 1993 | ||
| j8 | | Laurence Boxer, Russ Miller: Parallel algorithms for all maximal equally-spaced collinear sets and all maximal regular coplanar lattices. Pattern Recognition Letters 14(1): 17-22 (1993) |
| j7 | | Laurence Boxer, Chun-Shi Chang, Russ Miller, Andrew Rau-Chaplin: Polygonal approximation by boundary reduction. Pattern Recognition Letters 14(2): 111-119 (1993) |
| j6 | | Laurence Boxer: Computing deviations from convexity in polygons. Pattern Recognition Letters 14(3): 163-167 (1993) |
| 1992 | ||
| j5 | | |
| 1990 | ||
| j4 | | Laurence Boxer, Russ Miller: Common Intersections of Polygons. Inf. Process. Lett. 33(5): 249-254 (1990) |
| j3 | | |
| 1989 | ||
| j2 | | Laurence Boxer, Russ Miller: A Parallel Circle-Cover Minimization Algorithm. Inf. Process. Lett. 32(2): 57-60 (1989) |
| j1 | | Laurence Boxer, Russ Miller: Dynamic computational geometry on meshes and hypercubes. The Journal of Supercomputing 3(3): 161-191 (1989) |
| 1988 | ||
| c1 | | Laurence Boxer, Russell B. Miller: Dynamic Computational Geometry on Meshes and Hypercubes. ICPP (1) 1988: 323-330 |
| 1 | Chun-Shi Chang 0001 | |
| 2 | Ismet Karaca | |
| 3 | Russ Miller | |
| 4 | Russell B. Miller | |
| 5 | Andrew Rau-Chaplin |
Data released under the ODC-BY 1.0 license — See also our legal information page