Sciweavers

4745 search results - page 18 / 949
» Discretization: An Enabling Technique
Sort
View
COMPGEOM
1995
ACM
13 years 11 months ago
A New Technique for Analyzing Substructures in Arrangements
We present a simple but powerful new probabilistic technique for analyzing the combinatorial complexity of various substructures in arrangements of piecewise-linear surfaces in hig...
Boaz Tagansky
TSE
2002
107views more  TSE 2002»
13 years 7 months ago
Fluid Stochastic Petri Nets Augmented with Flush-Out Arcs: A Transient Analysis Technique
Fluid (or Hybrid) Petri Nets with flush-out arcs are Petri net based models with two classes of places: discrete places that carry a natural number of distinct objects (tokens), a...
Marco Gribaudo, András Horváth
COMPGEOM
1997
ACM
13 years 11 months ago
Computing Exact Geometric Predicates Using Modular Arithmetic with Single Precision
Abstract: We propose an e cient method that determines the sign of a multivariate polynomial expression with integer coe cients. This is a central operation on which the robustness...
Hervé Brönnimann, Ioannis Z. Emiris, V...
MOC
2002
92views more  MOC 2002»
13 years 7 months ago
Error indicators for the mortar finite element discretization of the Laplace equation
The mortar technique turns out to be well adapted to handle mesh adaptivity in finite elements, since it allows for working with nonnecessarily compatible discretizations on the el...
Christine Bernardi, Frédéric Hecht
ECCV
2004
Springer
14 years 28 days ago
Cone-Beam Image Reconstruction by Moving Frames
In this paper, we present a new algorithmic paradigm for cone-beam image reconstruction. The new class of algorithms, referred to as cone-beam reconstruction by moving frames, enab...
Xiaochun Yang 0002, Berthold K. P. Horn