Beta skeleton

Known as: Beta-skeleton, Β-skeleton 
In computational geometry and geometric graph theory, a β-skeleton or beta skeleton is an undirected graph defined from a set of points in the… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
A β-skeleton is a proximity undirected graph whose connectivity is determined by the parameter β . We study β-skeleton automata… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2010
Highly Cited
2010
We describe a generic framework for representing and reasoning with annotated Semantic Web data, formalise the annotated language… (More)
Is this relevant?
2007
2007
In two dimensions, the beta-skeleton is one of the most practical methods for reconstructing smooth curves from a given… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2005
2005
This study compared Pairs of students with Single students in Web search tasks. The underlying hypothesis was that peer-to-peer… (More)
  • table 1
  • table 2
  • table 3
  • table 4
  • table 5
Is this relevant?
2004
2004
In recent years, there has been much interest in phase transitions of combinatorial problems. Phase transitions have been… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2003
2003
In this paper we study the spanning ratio of the βskeletons for β ∈ [0, 2]. Both our upper-bounds and lower-bounds improve the… (More)
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
1998
Highly Cited
1998
We construct a graph on a planar point set, which captures its shape in the following sense: if a smooth curve is sampled densely… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1997
Highly Cited
1997
We construct a graph on a planar point set, which captures its shape in the following sense: if a smooth curve is sampled densely… (More)
Is this relevant?
1996
1996
Given a set S of n points in the plane, a triangulation is a maximal set of non-intersecting edges connecting the points in S… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 6
Is this relevant?
1996
1996
In this paper, two sufficient conditions for identifying a subgraph of minimum weight triangulation of a planar point set are… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?