Colin B. Macdonald

h-index16
2papers
1,132citations

2 Papers

0.9CVNov 25, 2019
Nearest Neighbor Sampling of Point Sets using Rays

Liangchen Liu, Louis Ly, Colin Macdonald et al.

We propose a new framework for the sampling, compression, and analysis of distributions of point sets and other geometric objects embedded in Euclidean spaces. Our approach involves constructing a tensor called the RaySense sketch, which captures nearest neighbors from the underlying geometry of points along a set of rays. We explore various operations that can be performed on the RaySense sketch, leading to different properties and potential applications. Statistical information about the data set can be extracted from the sketch, independent of the ray set. Line integrals on point sets can be efficiently computed using the sketch. We also present several examples illustrating applications of the proposed strategy in practical scenarios.

1.2NAOct 27, 2014
The Closest Point Method and multigrid solvers for elliptic equations on surfaces

Yujia Chen, Colin B. Macdonald

Elliptic partial differential equations are important both from application and analysis points of views. In this paper we apply the Closest Point Method to solving elliptic equations on general curved surfaces. Based on the closest point representation of the underlying surface, we formulate an embedding equation for the surface elliptic problem, then discretize it using standard finite differences and interpolation schemes on banded, but uniform Cartesian grids. We prove the convergence of the difference scheme for the Poisson's equation on a smooth closed curve. In order to solve the resulting large sparse linear systems, we propose a specific geometric multigrid method in the setting of the Closest Point Method. Convergence studies both in the accuracy of the difference scheme and the speed of the multigrid algorithm show that our approaches are effective.