2 citations · 6 across the 5 of their papers we have counts for
5 papers
On Divergence-based Distance Functions for Multiply-connected Domains
Renjie Chen, Craig Gotsman, Kai Hormann
Given a finitely-connected bounded planar domain , it is possible to define a {\it divergence distance} from to , which takes into account the complex ge…
Practical Distance Functions for Path-Planning in Planar Domains
Renjie Chen, Craig Gotsman, Kai Hormann
Path planning is an important problem in robotics. One way to plan a path between two points within a (not necessarily simply-connected) planar domain , is to define a non…
Path Planning with Divergence-Based Distance Functions
Renjie Chen, Craig Gotsman, Kai Hormann
Distance functions between points in a domain are sometimes used to automatically plan a gradient-descent path towards a given target point in the domain, avoiding obstacles that m…
Symmetric four-directional bivariate pseudo-splines
Costanza Conti, Chongyang Deng, Kai Hormann
Univariate pseudo-splines are a generalization of uniform B-splines and interpolatory -point subdivision schemes. Each pseudo-spline is characterized as the subdivision scheme…
Univariate subdivision schemes for noisy data
Nira Dyn, Allison Heard, Kai Hormann +1
We introduce and analyse univariate, linear, and stationary subdivision schemes for refining noisy data, by fitting local least squares polynomials. We first present primal schemes…