4850 search results - page 302 / 970 » Proof and Computation in Geometry |
208
click to vote
AGP
1995
IEEE
15 years 10 months ago
1995
IEEE
In this paper, we describe a Prolog implementation of a new theorem prover for (normal propositional) modal and multi–modal logics. The theorem prover, which is called KEM, arise...
154
click to vote
COMPGEOM
2004
ACM
16 years 5 days ago
2004
ACM
We prove that the lines tangent to four possibly intersecting convex polyhedra in 3 with n edges in total form Θ(n2 ) connected components in the worst case. In the generic ca...
183
click to vote
SMA
2003
ACM
15 years 12 months ago
2003
ACM
The presented approach to discretization of functionally defined heterogeneous objects is oriented towards applications associated with numerical simulation procedures, for exampl...
154
click to vote
VRML
2000
ACM
15 years 11 months ago
2000
ACM
We discuss potential and limitations of a Morph Node, inspired by the corresponding construct in Java3D. A Morph Node in Java3D interpolates vertex attributes among several homeom...
176
click to vote
COMPGEOM
2008
ACM
15 years 8 months ago
2008
ACM
This video illustrates an algorithm for computing a maximum number of disjoint paths for unit disks moving among a set of dynamic obstacles in the plane. The problem is motivated ...