Sciweavers

835 search results - page 102 / 167
» Geometric Logic in Computer Science
Sort
View
CAD
2008
Springer
13 years 10 months ago
Constrained curve fitting on manifolds
When designing curves on surfaces the need arises to approximate a given noisy target shape by a smooth fitting shape. We discuss the problem of fitting a B-spline curve to a poin...
Simon Flöry, Michael Hofer
CAD
2005
Springer
13 years 9 months ago
Efficiency of boundary evaluation for a cellular model
Feature modeling systems usually employ a boundary representation (b-rep) to store the shape information on a product. It has, however, been shown that a b-rep has a number of sho...
Rafael Bidarra, Joaquim Madeira, Willem J. Neels, ...
CAD
2005
Springer
13 years 9 months ago
A Delaunay-based region-growing approach to surface reconstruction from unorganized points
This paper presents a Delaunay-based region-growing (DBRG) surface reconstruction algorithm that holds the advantages of both Delaunay-based and region-growing approaches. The pro...
Chuan-Chu Kuo, Hong-Tzong Yau
COMPGEOM
2010
ACM
14 years 3 months ago
A kinetic triangulation scheme for moving points in the plane
We present a simple randomized scheme for triangulating a set P of n points in the plane, and construct a kinetic data structure which maintains the triangulation as the points of...
Haim Kaplan, Natan Rubin, Micha Sharir
RTA
2009
Springer
14 years 4 months ago
An Explicit Framework for Interaction Nets
Abstract. Interaction nets are a graphical formalism inspired by Linear Logic proof-nets often used for studying higher order rewriting e.g. β-reduction. Traditional presentations...
Marc de Falco