367 search results - page 38 / 74 » Geometric Structure Computation from Conics |
COMPGEOM
2010
ACM
14 years 2 months ago
2010
ACM
A graph is near-planar if it can be obtained from a planar graph by adding an edge. We show that it is NP-hard to compute the crossing number of near-planar graphs. The main idea ...
CGF
2008
13 years 10 months ago
2008
We describe algorithms for canonically partitioning semi-regular quadrilateral meshes into structured submeshes, using an adaptation of the geometric motorcycle graph of Eppstein ...
FLAIRS
1998
13 years 11 months ago
1998
Computer assisted tomography (CAT) systems demandlarge amounts of time and space. In this paper, wedescribe an approachto solving the CAT problemusing several AItechniques includi...
ECCV
2006
Springer
14 years 11 months ago
2006
Springer
Abstract. Conventional photometric stereo has a fundamental limitation that the scale of recovered geometry is limited to the resolution of the input images. However, surfaces that...
PAMI
2011
13 years 4 months ago
2011
— This paper addresses recognition of human actions under view changes. We explore self-similarities of action sequences over time and observe the striking stability of such meas...