We introduce a new algorithm for fitting a Catmull-Clark subdivision surface to a given shape within a prescribed tolerance, based on the method of quasi-interpolation. The fitting algorithm is fast, local and scalable since it does not require the solution of linear systems. Its convergence rate is optimal for regular meshes and our experiments show that it behaves very well for irregular mesh...

The use of Herbert Clark’s work as a theoretical framework in the Computer Supported Collaborative Work domain is often dismissed or judged as “cooked” and led to a large body of controversy. This article intends to reconsider his contribution and re-examined the criticisms he received. The main critics addressed to Clark are that his notion of Common Ground is far too mentalist and lacks “situ...

We propose a heuristic approach based on the Clarke-Wright algorithm (CW) to solve the open version of the well-known capacitated vehicle routing problem in which vehicles are not required to return to the depot after completing service. The proposed CW has been presented in four procedures composed of Clarke-Wright formula modification, open-route construction, two-phase selection, and route p...

In this paper we extend the PAC learning algorithm due to Clark and Thollard for learning distributions generated by PDFA to automata whose transitions may take varying time lengths, governed by exponential distributions.

an operator associated with the wright function is introduced in the open unit disk. differential subordination and superordination results associated with this operator are obtained by investigating appropriate classes of admissible functions. in particular, some inequalities for modified bessel functions are also obtained.