Laurence Boxer - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 32 from 32

2021

Coarse Grained Parallel SelectionLaurence Boxer. ppl, 31(1), 2021. [doi]

2016

Connectivity Preserving Multivalued Functions in Digital TopologyLaurence Boxer, P. Christopher Staecker. jmiv, 55(3):370-377, 2016. [doi]

2010

Some Properties of Digital Covering SpacesLaurence Boxer, Ismet Karaca. jmiv, 37(1):17-26, 2010. [doi]

2009

Efficient Coarse Grained Permutation Exchanges and Matrix MultiplicationLaurence Boxer. ppl, 19(3):477-484, 2009. [doi]

2008

The Classification of Digital Covering SpacesLaurence Boxer, Ismet Karaca. jmiv, 32(1):23-29, 2008. [doi]

2007

Fundamental Groups of Unbounded Digital ImagesLaurence Boxer. jmiv, 27(2):121-127, 2007. [doi]

2006

Digital Products, Wedges, and Covering SpacesLaurence Boxer. jmiv, 25(2):159-171, 2006. [doi]

Homotopy Properties of Sphere-Like Digital ImagesLaurence Boxer. jmiv, 24(2):167-175, 2006. [doi]

2005

A Pre-Processing Algorithm for String Pattern MatchingLaurence Boxer. amcs 2005: 29-32

Properties of Digital HomotopyLaurence Boxer. jmiv, 22(1):19-26, 2005. [doi]

2004

Coarse grained gather and scatter operations with applicationsLaurence Boxer, Russ Miller. jpdc, 64(11):1297-1310, 2004. [doi]

2002

Corrigendum to Efficient Computation of the Euclidean Distance Transform Laurence Boxer, Russ Miller. cviu, 86(2):137-140, 2002. [doi]

2001

A parallel algorithm for approximate regularityLaurence Boxer, Russ Miller. ipl, 80(6):311-316, 2001. [doi]

2000

Efficient Computation of the Euclidean Distance TransformLaurence Boxer, Russ Miller. cviu, 80(3):379-383, 2000. [doi]

1999

A Classical Construction for the Digital Fundamental GroupLaurence Boxer. jmiv, 10(1):51-62, 1999. [doi]

Scalable Parallel Algorithms for Geometric Pattern RecognitionLaurence Boxer, Russ Miller, Andrew Rau-Chaplin. jpdc, 58(3):466-486, 1999.

1998

Faster point set pattern matching in 3-DLaurence Boxer. prl, 19(13):1235-1240, 1998. [doi]

Scaleable Parallel Algorithms for Lower Envelopes with ApplicationsLaurence Boxer, Russ Miller, Andrew Rau-Chaplin. jpdc, 53(2):91-118, 1998.

1997

On Hausdorff-like metrics for fuzzy setsLaurence Boxer. prl, 18(2):115-118, 1997. [doi]

Corrigenda to On Hausdorff-like metrics for fuzzy sets [Pattern Recognition Lettes Vol. 18, (1997) 115-118]Laurence Boxer. prl, 18(5):505-506, 1997. [doi]

1996

Point set pattern matching in 3-DLaurence Boxer. prl, 17(12):1293-1297, 1996. [doi]

1994

Digitally continuous functionsLaurence Boxer. prl, 15(8):833-839, 1994. [doi]

1993

Computing deviations from convexity in polygonsLaurence Boxer. prl, 14(3):163-167, 1993. [doi]

Parallel algorithms for all maximal equally-spaced collinear sets and all maximal regular coplanar latticesLaurence Boxer, Russ Miller. prl, 14(1):17-22, 1993. [doi]

Polygonal approximation by boundary reductionLaurence Boxer, Chun-Shi Chang, Russ Miller, Andrew Rau-Chaplin. prl, 14(2):111-119, 1993. [doi]

1992

Finding congruent regions in parallelLaurence Boxer. pc, 18(7):807-810, 1992.

1990

Corrigenda: Common Intersections of PolygonsLaurence Boxer. ipl, 35(1):53, 1990.

Common Intersections of PolygonsLaurence Boxer, Russ Miller. ipl, 33(5):249-254, 1990.

1989

A Parallel Circle-Cover Minimization AlgorithmLaurence Boxer, Russ Miller. ipl, 32(2):57-60, 1989.

Dynamic computational geometry on meshes and hypercubesLaurence Boxer, Russ Miller. tjs, 3(3):161-191, 1989. [doi]

1988

Dynamic Computational Geometry on Meshes and HypercubesLaurence Boxer, Russell B. Miller. icpp 1988: 323-330

Dynamic computational geometry on parallel computersLaurence Boxer, Russ Miller. c3p 1988: 1212-1219 [doi]

Sign in or sign up to see more results.

runs on WebDSL