Sciweavers

2125 search results - page 67 / 425
» Points with Type-2 Operations
Sort
View
CAGD
2008
124views more  CAGD 2008»
13 years 9 months ago
All triangulations are reachable via sequences of edge-flips: an elementary proof
A simple proof is provided for the fact that the set of all possible triangulations of a planar point set in a polygonal domain is closed under the basic diagonal flip operation.
Eliyahu Osherovich, Alfred M. Bruckstein
COMGEO
2006
ACM
13 years 9 months ago
A result about the density of iterated line intersections in the plane
Let S be a finite set of points in the plane and let T (S) be the set of intersection points between pairs of lines passing through any two points in S. We characterize all configu...
Christopher J. Hillar, Darren L. Rhea
CCE
2008
13 years 9 months ago
Safe-parking of nonlinear process systems
This work considers the problem of control of nonlinear process systems subject to input constraints and actuator faults. Faults are considered that preclude the possibility of con...
Rahul Gandhi, Prashant Mhaskar
SAS
1993
Springer
126views Formal Methods» more  SAS 1993»
14 years 28 days ago
Finiteness Conditions for Strictness Analysis
We give upper bounds on the number of times the fixed point operator needs to be unfolded for strictness analysis of functional languages with lists. This extends previous work b...
Flemming Nielson, Hanne Riis Nielson
CG
2004
Springer
13 years 8 months ago
Dynamic surfel set refinement for high-quality rendering
Splatting-based rendering techniques are currently the best choice for efficient high-quality rendering of point-based geometries. However, such techniques are not suitable for la...
Gaël Guennebaud, Loïc Barthe, Mathias Pa...