Laurence Boxer

Parallel Process. Lett., 2021

Beyond the Hausdorff Metric in Digital Topology.

[BibT_eX]

[DOI]

CoRR, 2021

2017

The Saukas-Song Selection Algorithm and Coarse Grained Parallel Sorting.

[BibT_eX]

[DOI]

CoRR, 2017

2016

Connectivity Preserving Multivalued Functions in Digital Topology.

[BibT_eX]

[DOI]

J. Math. Imaging Vis., 2016

2015

Homotopy relations for digital images.

[BibT_eX]

[DOI]

CoRR, 2015

Alternate version of continuity for digital multivalued functions.

[BibT_eX]

[DOI]

CoRR, 2015

Remarks on pointed digital homotopy.

[BibT_eX]

[DOI]

CoRR, 2015

2010

Some Properties of Digital Covering Spaces.

[BibT_eX]

[DOI]

Ismet Karaca

J. Math. Imaging Vis., 2010

2009

Efficient Coarse Grained Permutation Exchanges and Matrix Multiplication.

[BibT_eX]

[DOI]

Parallel Process. Lett., 2009

2008

The Classification of Digital Covering Spaces.

[BibT_eX]

[DOI]

Ismet Karaca

J. Math. Imaging Vis., 2008

2007

Fundamental Groups of Unbounded Digital Images.

[BibT_eX]

[DOI]

J. Math. Imaging Vis., 2007

2006

Homotopy Properties of Sphere-Like Digital Images.

[BibT_eX]

[DOI]

J. Math. Imaging Vis., 2006

Digital Products, Wedges, and Covering Spaces.

[BibT_eX]

[DOI]

J. Math. Imaging Vis., 2006

2005

Properties of Digital Homotopy.

[BibT_eX]

[DOI]

J. Math. Imaging Vis., 2005

A Pre-Processing Algorithm for String Pattern Matching.

[BibT_eX]

Proceedings of the 2005 International Conference on Algorithmic Mathematics and Computer Science, 2005

2004

Coarse grained gather and scatter operations with applications.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 2004

2002

Corrigendum to "Efficient Computation of the Euclidean Distance Transform".

[BibT_eX]

[DOI]

Comput. Vis. Image Underst., 2002

2001

A parallel algorithm for approximate regularity.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2001

2000

Efficient Computation of the Euclidean Distance Transform.

[BibT_eX]

[DOI]

Comput. Vis. Image Underst., 2000

1999

Scalable Parallel Algorithms for Geometric Pattern Recognition.

[BibT_eX]

[DOI]

Andrew Rau-Chaplin

J. Parallel Distributed Comput., 1999

A Classical Construction for the Digital Fundamental Group.

[BibT_eX]

[DOI]

J. Math. Imaging Vis., 1999

1998

Faster point set pattern matching in 3-D.

[BibT_eX]

[DOI]

Pattern Recognit. Lett., 1998

Scaleable Parallel Algorithms for Lower Envelopes with Applications.

[BibT_eX]

[DOI]

Andrew Rau-Chaplin

J. Parallel Distributed Comput., 1998

1997

Corrigenda to "On Hausdorff-like metrics for fuzzy sets" [Pattern Recognition Lettes Vol. 18, (1997) 115-118]

[BibT_eX]

[DOI]

Pattern Recognit. Lett., 1997

On Hausdorff-like metrics for fuzzy sets.

[BibT_eX]

[DOI]

Pattern Recognit. Lett., 1997

1996

Point set pattern matching in 3-D.

[BibT_eX]

[DOI]

Pattern Recognit. Lett., 1996

1994

Digitally continuous functions.

[BibT_eX]

[DOI]

Pattern Recognit. Lett., 1994

1993

Parallel algorithms for all maximal equally-spaced collinear sets and all maximal regular coplanar lattices.

[BibT_eX]

[DOI]

Pattern Recognit. Lett., 1993

Polygonal approximation by boundary reduction.

[BibT_eX]

[DOI]

Pattern Recognit. Lett., 1993

Computing deviations from convexity in polygons.

[BibT_eX]

[DOI]

Pattern Recognit. Lett., 1993

1992

Finding congruent regions in parallel.

[BibT_eX]

[DOI]

Parallel Comput., 1992

1990

Common Intersections of Polygons.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1990

Corrigenda: Common Intersections of Polygons.

[BibT_eX]

Inf. Process. Lett., 1990

1989

Dynamic computational geometry on meshes and hypercubes.

[BibT_eX]

[DOI]

J. Supercomput., 1989

A Parallel Circle-Cover Minimization Algorithm.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1989

1988

Dynamic Computational Geometry on Meshes and Hypercubes.

[BibT_eX]

Russell B. Miller

Proceedings of the International Conference on Parallel Processing, 1988

Dynamic computational geometry on parallel computers.

[BibT_eX]

[DOI]