Sciweavers

2262 search results - page 26 / 453
» Points with large quadrant-depth
Sort
View
ESA
2009
Springer
144views Algorithms» more  ESA 2009»
15 years 6 months ago
Narrow-Shallow-Low-Light Trees with and without Steiner Points
We show that for every set S of n points in the plane and a designated point rt ∈ S, there exists a tree T that has small maximum degree, depth and weight. Moreover, for every po...
Michael Elkin, Shay Solomon
ICRA
2008
IEEE
205views Robotics» more  ICRA 2008»
15 years 6 months ago
Minimum time point assignment for coverage by two constrained robots
— This paper focuses on the assignment of discrete points to two robots, in the presence of geometric and kinematic constraints between the robots. The individual points have dif...
Nilanjan Chakraborty, Srinivas Akella, John T. Wen
CGI
2001
IEEE
15 years 3 months ago
Polygonizing Non-Uniformly Distributed 3D Points by Advancing Mesh Frontiers
30 digitization devices produce very large sets of 3 0 points sampled from the suqaces of the objects being scanned. A mesh construction procedure needs to be:upplied to derive po...
Indriyati Atmosukarto, Luping Zhou, Wee Kheng Leow...
ACE
2004
224views Education» more  ACE 2004»
15 years 1 months ago
Automating the Estimation of Project Size from Software Design Tools Using Modified Function Points
Final year students in the Bachelor of Computing complete an industry project where they work in teams to build an IT system for an external client. Grading projects in these circ...
Jason Ceddia, Martin Dick
AAAI
2000
15 years 1 months ago
Generalizing Boundary Points
The complexity of numerical domain partitioning depends on the number of potential cut points. In multiway partitioning this dependency is often quadratic, even exponential. There...
Tapio Elomaa, Juho Rousu