| 程序包 | 说明 |
|---|---|
| cn.jimmiez.pcu.alg.skeleton |
The skeleton of point cloud is 1d curve which can capture the essential
topology of 3d models.
|
| cn.jimmiez.pcu.common.graph |
Graph is a commonly-used data structure in point cloud processing.
|
| cn.jimmiez.pcu.model |
This package provides some entity classes which represent point cloud or
polygonal mesh.
|
| 限定符和类型 | 方法和说明 |
|---|---|
BaseGraph |
LevelSetSkeleton.getNeighborhoodGraph() |
| 限定符和类型 | 接口和说明 |
|---|---|
interface |
Graph
An abstract graph that support more operations compared to
BaseGraph |
| 限定符和类型 | 类和说明 |
|---|---|
class |
DirectedGraph
A directed graph in which the edges is store in a HashMap.
|
class |
EntityGraph<E>
Entity graph here is a graph whose vertices are Java objects.
|
class |
UndirectedGraph
A undirected graph in which the edges is store in a HashMap.
|
| 限定符和类型 | 方法和说明 |
|---|---|
static BaseGraph |
Graphs.empty() |
static BaseGraph |
Graphs.fullConnectedGraph(List<javax.vecmath.Point3d> vertices) |
static BaseGraph |
Graphs.graph(double[][] edges,
int[][] adjacency) |
static BaseGraph |
Graphs.knnGraph(List<javax.vecmath.Point3d> vertices,
List<int[]> knnIndices) |
static BaseGraph |
Graphs.subGraph(BaseGraph graph,
Set<Integer> vertices)
get a graph where the vertices is a sub-set of another graph
|
| 限定符和类型 | 方法和说明 |
|---|---|
static List<List<Integer>> |
Graphs.connectedComponents(BaseGraph graph) |
static Map<Integer,Pair<List<Integer>,Double>> |
ShortestPath.dijkstra(BaseGraph graph,
int rootIndex)
dijkstra algorithm
|
static int |
Graphs.edgesCountOf(BaseGraph graph)
compute the number of edges in a graph
|
static BaseGraph |
Graphs.subGraph(BaseGraph graph,
Set<Integer> vertices)
get a graph where the vertices is a sub-set of another graph
|
| 限定符和类型 | 类和说明 |
|---|---|
class |
Skeleton
Use a undirected acyclic graph for representing a curve skeleton
|
Copyright © 2019. All rights reserved.