ICCSA
2007
Springer
13 years 11 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...
AGILE
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. In cartography and computational geometry, concepts and techniques for automated label placement have been developed for twodimensional maps. Less is known whether these ...
FOCS
2009
IEEE
13 years 11 months ago
2009
IEEE
In orthogonal range reporting we are to preprocess N points in d-dimensional space so that the points inside a d-dimensional axis-aligned query box can be reported efficiently. T...
5
posts
with
2724
views
2724
views
He is graduated in both Applied Mathematics and Computer Science in 2006 and 2009 respectively. Having started his research on Computer Graphics (specifically Computer Aided Design...
STOC
2004
ACM
14 years 5 months ago
2004
ACM
Abstract. In the late nineties, Erickson proved a remarkable lower bound on the decision tree complexity of one of the central problems of computational geometry: given n numbers, ...
Lecture Notes
"This is a standard senior-level algorithms class required of every computer science undergraduate and graduate student at the University of Illinois."
0
posts
with
0
views
0
views
