1012 search results - page 16 / 203 » Segment intersection searching problems in general settings |
143
click to vote
ICCBR
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. Acquiring adaptation knowledge for case-based reasoning systems is a challenging problem. Such knowledge is typically elicited from domain experts or extracted from the c...
133
Voted
EPS
1998
Springer
15 years 8 months ago
1998
Springer
The task of finding minimal elements of a partially ordered set is a generalization of the task of finding the global minimum of a real-valued function or of finding Pareto-optimal...
111
Voted
COMPGEOM
2004
ACM
15 years 9 months ago
2004
ACM
Robustness problems due to the substitution of the exact computation on real numbers by the rounded floating point arithmetic are often an obstacle to obtain practical implementa...
142
Voted
CAGD
2010
15 years 1 months ago
2010
We present an exact algorithm for computing the precise Hausdorff distance between two general polyhedra represented as triangular meshes. The locus of candidate points, events wh...
138
Voted
ICCSA
2007
Springer
15 years 10 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...