2000
DOI: 10.2172/760739
|View full text |Cite
|
Sign up to set email alerts
|

Some Provable Properties of VERI Clustering

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2002
2002
2002
2002

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(2 citation statements)
references
References 1 publication
0
2
0
Order By: Relevance
“…First, all of the agents are part of a connected graph. This property has been proven to be true for any number and configuration of agents and any dimensionality of the agent spatial positions [6]. Second, the graph edges for each agent have a minimum relative angle between them.…”
Section: Clustering Networkmentioning
confidence: 83%
See 1 more Smart Citation
“…First, all of the agents are part of a connected graph. This property has been proven to be true for any number and configuration of agents and any dimensionality of the agent spatial positions [6]. Second, the graph edges for each agent have a minimum relative angle between them.…”
Section: Clustering Networkmentioning
confidence: 83%
“…Many simple mathematical ROI shapes have been explored in the literature, and the mathematical properties of the resulting graphs have been examined. Here we present a new ROI shape that we have proposed, called the bow tie [6], that has been designed to produce useful graph structures for purposes of swarm agent interactions and communication. We first present the shape, then describe and illustrate the graph properties that provably follow from this shape.…”
Section: Clustering Networkmentioning
confidence: 99%