Sciweavers

3824 search results - page 236 / 765
» Geometry Constructions Language
Sort
View
PLPV
2010
ACM
16 years 1 months ago
Free theorems for functional logic programs
Type-based reasoning is popular in functional programming. In particular, parametric polymorphism constrains functions in such a way that statements about their behavior can be de...
Jan Christiansen, Daniel Seidel, Janis Voigtlä...
SAC
2008
ACM
15 years 3 months ago
Symbiosis in logic-based pointcuts over a history of join points
Within aspect-oriented programming, the quality of aspect code depends on the readability and expressiveness of pointcut languages. Readability is increased by using specialized, ...
Kris Gybels, Charlotte Herzeel, Theo D'Hondt
VIS
2004
IEEE
170views Visualization» more  VIS 2004»
16 years 5 months ago
Guaranteed Quality Triangulation of Molecular Skin Surfaces
We present an efficient algorithm to mesh the macromolecules surface model represented by the skin surface defined by Edelsbrunner. Our algorithm overcomes several challenges resi...
Ho-Lun Cheng, Xinwei Shi
SAC
2009
ACM
15 years 11 months ago
Origami fold as algebraic graph rewriting
We formalize paper fold (origami) by graph rewriting. Origami construction is abstractly described by a rewriting sys), where O is the set of abstract origami’s and ary relation...
Tetsuo Ida, Hidekazu Takahashi
CASC
2007
Springer
108views Mathematics» more  CASC 2007»
15 years 10 months ago
Comprehensive Triangular Decomposition
We introduce the concept of comprehensive triangular decomposition (CTD) for a parametric polynomial system F with coefficients in a field. In broad words, this is a finite part...
Changbo Chen, Oleg Golubitsky, François Lem...