Sciweavers

92 search results - page 5 / 19
» Stabbers of line segments in the plane
Sort
View
SODA
2001
ACM
86views Algorithms» more  SODA 2001»
13 years 8 months ago
Pattern matching for sets of segments
In this paper we present algorithms for a number of problems in geometric pattern matching where the input consist of a collections of segments in the plane. Our work consists of ...
Alon Efrat, Piotr Indyk, Suresh Venkatasubramanian
GD
2008
Springer
13 years 8 months ago
Visibility Representations of Four-Connected Plane Graphs with Near Optimal Heights
A visibility representation of a graph G is to represent the nodes of G with non-overlapping horizontal line segments such that the line segments representing any two distinct adja...
Chieh-Yu Chen, Ya-Fei Hung, Hsueh-I Lu
GRAPHICSINTERFACE
2000
13 years 8 months ago
Dynamic Plane Shifting BSP Traversal
Interactive 3D applications require fast detection of objects colliding with the environment. One popular method for fast collision detection is to offset the geometry of the envi...
Stan Melax
ISAAC
2004
Springer
98views Algorithms» more  ISAAC 2004»
14 years 21 days ago
Inner Rectangular Drawings of Plane Graphs
A drawing of a plane graph is called an inner rectangular drawing if every edge is drawn as a horizontal or vertical line segment so that every inner face is a rectangle. An inner ...
Kazuyuki Miura, Hiroki Haga, Takao Nishizeki
IVC
2007
98views more  IVC 2007»
13 years 7 months ago
Reversible vectorisation of 3D digital planar curves and applications
This paper tackles the problem of the computation of a planar polygonal curve from a digital planar curve, such that the digital data can be exactly retrieved from the polygonal c...
Isabelle Sivignon, Florent Dupont, Jean-Marc Chass...