176 search results - page 15 / 36 » On Directed Triangles in Digraphs |
IPCO
2007
13 years 8 months ago
2007
Erd˝os, Purdy, and Straus conjectured that the number of distinct (nonzero) areas of the triangles determined by n noncollinear points in the plane is at least n−1 2 , which is...
GRAPHICSINTERFACE
2000
13 years 8 months ago
2000
We present a method to incrementally voxelize triangles into a volumetric dataset with pre-filtering, generating an accurate multivalued voxelization. Multivalued voxelization all...
STOC
2003
ACM
14 years 7 months ago
2003
ACM
Let H be a fixed directed graph on h vertices, let G be a directed graph on n vertices and suppose that at least n2 edges have to be deleted from it to make it H-free. We show tha...
CVPR
2003
IEEE
14 years 9 months ago
2003
IEEE
In this paper, we describe an algorithm called Fast Marching Watersheds that segments a triangle mesh into visual parts. This computer vision algorithm leverages a human vision th...
CGI
2004
IEEE
13 years 11 months ago
2004
IEEE
This paper presents a new and efficient algorithm for decomposition of 3D arbitrary triangle mesh into surface patches. Our method is based on the curvature tensor field analysis ...