Sciweavers

1370 search results - page 178 / 274
» On grids in topological graphs
Sort
View
ENDM
2007
106views more  ENDM 2007»
15 years 6 months ago
Removing Even Crossings on Surfaces
In this paper we investigate how certain results related to the HananiTutte theorem can be extended from the plane to surfaces. We give a simple topological proof that the weak Ha...
Michael J. Pelsmajer, Marcus Schaefer, Daniel Stef...
CORR
2002
Springer
79views Education» more  CORR 2002»
15 years 6 months ago
Optimally cutting a surface into a disk
We consider the problem of cutting a subset of the edges of a polyhedral manifold surface, possibly with boundary, to obtain a single topological disk, minimizing either the total...
Jeff Erickson, Sariel Har-Peled
CPM
2011
Springer
283views Combinatorics» more  CPM 2011»
14 years 9 months ago
Frequent Submap Discovery
Combinatorial maps are nice data structures for modeling the topology of nD objects subdivided in cells (e.g., vertices, edges, faces, volumes, ...) by means of incidence and adjac...
Stéphane Gosselin, Guillaume Damiand, Chris...
SIGMETRICS
2011
ACM
139views Hardware» more  SIGMETRICS 2011»
14 years 9 months ago
Slick packets
Source-controlled routing has been proposed as a way to improve flexibility of future network architectures, as well as simplifying the data plane. However, if a packet specifie...
Giang T. K. Nguyen, Rachit Agarwal, Junda Liu, Mat...
ICIP
2003
IEEE
16 years 8 months ago
Detection and extraction of road networks from high resolution satellite images
This article addresses the problem of road extraction from new high resolution satellite images. The proposed algorithm is divided in two sequential modules : a topologically corr...
Renaud Péteri, Julien Celle, Thierry Ranchi...