90 search results - page 9 / 18 » Formalizing complex plane geometry |
163
Voted
IMR
2003
Springer
15 years 11 months ago
2003
Springer
We present a method for isotropic remeshing of arbitrary genus surfaces. The method is based on a mesh adaptation process, namely, a sequence of local modifications performed on ...
160
Voted
COMPGEOM
2008
ACM
15 years 7 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 ...
131
Voted
COSIT
2007
Springer
15 years 12 months ago
2007
Springer
In order to apply advanced high-level concepts for transportation networks, like hypergraphs, multi-level wayfinding and traffic forecasting, to commercially available street netwo...
171
Voted
ICCSA
2007
Springer
15 years 12 months ago
2007
Springer
Abstract. Determining whether two segments s and t in a planar polygonal scene weakly see each other is a classical problem in computational geometry. In this problem we seek for a...
169
click to vote
ACCV
2007
Springer
15 years 12 months ago
2007
Springer
We present a new framework for correcting multiperspective distortions using collineations. A collineation describes the transformation between the images of a camera due to change...