Sciweavers

6740 search results - page 149 / 1348
» An s -Hamiltonian Line Graph Problem
Sort
View
IJCGA
2006
85views more  IJCGA 2006»
13 years 10 months ago
Some Lower Bounds on Geometric Separability Problems
We obtain lower bounds in the algebraic computation tree model for deciding the separability of two disjoint point sets. In particular, we show (n log n) time lower bounds for sep...
Esther M. Arkin, Ferran Hurtado, Joseph S. B. Mitc...
SMA
2009
ACM
219views Solid Modeling» more  SMA 2009»
14 years 4 months ago
Log-aesthetic space curve segments
For designing aesthetic surfaces, such as the car bodies, it is very important to use aesthetic curves as characteristic lines. In such curves, the curvature should be monotonical...
Norimasa Yoshida, Ryo Fukuda, Takafumi Saito
WSC
1997
13 years 11 months ago
Sea Based Logistics: Distribution Problems for Future Global Contingencies
Evolving doctrine in the U. S. Marine Corps emphasizes small, highly-mobile forces, supported from the sea rather than from large, land-based supply points. We introduce some emer...
Keebom Kang, Kevin R. Gue
JCT
2011
89views more  JCT 2011»
13 years 5 months ago
On lines, joints, and incidences in three dimensions
We extend (and somewhat simplify) the algebraic proof technique of Guth and Katz [7], to obtain several sharp bounds on the number of incidences between lines and points in three ...
György Elekes, Haim Kaplan, Micha Sharir
SODA
2004
ACM
93views Algorithms» more  SODA 2004»
13 years 11 months ago
Bipartite roots of graphs
Graph H is a root of graph G if there exists a positive integer k such that x and y are adjacent in G if and only if their distance in H is at most k. Motwani and Sudan [1994] prov...
Lap Chi Lau