最終更新日
：2023/09/05
medial graph
noun
(graph
theory)
A
graph
derived
from
a
given
plane
graph
such
that
this
derived
graph
has
a
vertex
corresponding
to
each
edge
of
the
given
graph,
and
such
that
for
every
“angle”
(consecutive
trio
of
edge,
vertex,
edge)
along
the
border
of
a
face
of
the
given
graph
there
is
a
corresponding
edge
which
connects
the
vertices
corresponding
to
the
two
edges
that
are
part
of
that
“angle”.
意味（1）
(graph
theory)
A
graph
derived
from
a
given
plane
graph
such
that
this
derived
graph
has
a
vertex
corresponding
to
each
edge
of
the
given
graph,
and
such
that
for
every
“angle”
(consecutive
trio
of
edge,
vertex,
edge)
along
the
border
of
a
face
of
the
given
graph
there
is
a
corresponding
edge
which
connects
the
vertices
corresponding
to
the
two
edges
that
are
part
of
that
“angle”.
復習用の問題
正解を見る
(graph theory) A graph derived from a given plane graph such that this derived graph has a vertex corresponding to each edge of the given graph, and such that for every “angle” (consecutive trio of edge, vertex, edge) along the border of a face of the given graph there is a corresponding edge which connects the vertices corresponding to the two edges that are part of that “angle”.
正解を見る
The medial graph is a useful tool in image processing.
English Dictionary
項目の編集設定
- 項目の編集権限を持つユーザー - すべてのユーザー
- 項目の新規作成を審査する
- 項目の編集を審査する
- 項目の削除を審査する
- 重複の恐れのある項目名の追加を審査する
- 項目名の変更を審査する
- 審査に対する投票権限を持つユーザー - 編集者
- 決定に必要な投票数 - 1
例文の編集設定
- 例文の編集権限を持つユーザー - すべてのユーザー
- 例文の削除を審査する
- 審査に対する投票権限を持つユーザー - 編集者
- 決定に必要な投票数 - 1
問題の編集設定
- 問題の編集権限を持つユーザー - すべてのユーザー
- 審査に対する投票権限を持つユーザー - 編集者
- 決定に必要な投票数 - 1
