Sciweavers

4866 search results - page 402 / 974
» UML for Global Computing
Sort
View
CGI
2004
IEEE
15 years 10 months ago
Consistent Normal Orientation for Polygonal Meshes
In this paper, we propose a new method that can consistently orient all normals of any mesh (if at all possible), while ensuring that most polygons are seen with their front-faces...
Pavel Borodin, Gabriel Zachmann, Reinhard Klein
CGI
2006
IEEE
15 years 10 months ago
Feature Sensitive Out-of-Core Chartification of Large Polygonal Meshes
Mesh chartification is an important tool for processing meshes in various applications. In this paper, we present a novel feature sensitive mesh chartification technique that can h...
Sungyul Choe, Minsu Ahn, Seungyong Lee
CP
2006
Springer
15 years 10 months ago
The ROOTS Constraint
A wide range of counting and occurrence constraints can be specified with just two global primitives: the Range constraint, which computes the range of values used by a sequence of...
Christian Bessière, Emmanuel Hebrard, Brahi...
ENC
2006
IEEE
15 years 10 months ago
Adaptive Node Refinement Collocation Method for Partial Differential Equations
In this work, by using the local node refinement technique purposed in [2, 1], and a quad-tree type algorithm [3, 13], we built a global refinement technique for Kansa's unsy...
José Antonio Muñoz-Gómez, Ped...
SPIN
2000
Springer
15 years 10 months ago
Model Checking Based on Simultaneous Reachability Analysis
Abstract. Simultaneous reachability analysis SRA is a recently proposed approach to alleviating the state space explosion problem in reachability analysis of concurrent systems. Th...
Bengi Karaçali, Kuo-Chung Tai