Sciweavers

189 search results - page 4 / 38
» Graph-Theoretic Solutions to Computational Geometry Problems
Sort
View
JMIV
2010
115views more  JMIV 2010»
13 years 2 months ago
Generalized Convexity in Multiple View Geometry
Recent work on geometric vision problems has exploited convexity properties in order to obtain globally optimal solutions. In this paper we give an overview of these developments a...
Carl Olsson, Fredrik Kahl
CORR
2007
Springer
74views Education» more  CORR 2007»
13 years 7 months ago
Secure Two-party Protocols for Point Inclusion Problem
It is well known that, in theory, the general secure multiparty computation problem is solvable using circuit evaluation protocols. However, the communication complexity of the re...
Tony Thomas
CAD
2005
Springer
13 years 7 months ago
Industrial geometry: recent advances and applications in CAD
Industrial Geometry aims at unifying existing and developing new methods and algorithms for a variety of application areas with a strong geometric component. These include CAD, CA...
Helmut Pottmann, Stefan Leopoldseder, Michael Hofe...
COMPGEOM
2010
ACM
13 years 11 months ago
The complexity of the normal surface solution space
Normal surface theory is a central tool in algorithmic threedimensional topology, and the enumeration of vertex normal surfaces is the computational bottleneck in many important a...
Benjamin A. Burton
COCOA
2008
Springer
13 years 9 months ago
Computational Study on Dominating Set Problem of Planar Graphs
Abstract: Recently, there have been significant theoretical progresses towards fixed-parameter algorithms for the DOMINATING SET problem of planar graphs. It is known that the prob...
Marjan Marzban, Qian-Ping Gu, Xiaohua Jia