Sciweavers

1672 search results - page 9 / 335
» Tightness problems in the plane
Sort
View
COMGEO
2007
ACM
14 years 10 months ago
Drawings of planar graphs with few slopes and segments
We study straight-line drawings of planar graphs with few segments and few slopes. Optimal results are obtained for all trees. Tight bounds are obtained for outerplanar graphs, 2-...
Vida Dujmovic, David Eppstein, Matthew Suderman, D...
IPL
2006
97views more  IPL 2006»
14 years 10 months ago
A tight lower bound for job scheduling with cancellation
The Job Scheduling with Cancellation problem is a variation of classical scheduling problems in which jobs can be cancelled while waiting for execution. In this paper we prove a t...
Feifeng Zheng, Francis Y. L. Chin, Stanley P. Y. F...
SIAMNUM
2010
108views more  SIAMNUM 2010»
14 years 5 months ago
Shear Locking in a Plane Elasticity Problem and the Enhanced Assumed Strain Method
The method of enhanced assumed strains (EAS) is a popular tool for avoiding locking phenomena, e.g., a remedy for shear locking in plane elasticity. We consider bending-dominated p...
Dietrich Braess, Pingbing Ming, Zhongci Shi
AAIM
2009
Springer
119views Algorithms» more  AAIM 2009»
15 years 5 months ago
Link Distance and Shortest Path Problems in the Plane
We develop algorithms to compute Voronoi diagrams, shortest path maps, and the Fr´echet distance in the plane with polygonal obstacles. Distances between points are measured eithe...
Atlas F. Cook, Carola Wenk
EOR
2010
178views more  EOR 2010»
14 years 10 months ago
Facility location problems in the plane based on reverse nearest neighbor queries
For a finite set of points S, the (monochromatic) Reverse Nearest Neighbor (RNN) rule associates with any query point q the subset of points in S that have q as its nearest neighb...
Sergio Cabello, José Miguel Díaz-B&a...