# Polyhedron

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

Highly Cited

2006

Highly Cited

2006

- SODA
- 2006

We show that generating all negative cycles of a weighted graph is a hard enumeration problem, in both the directed and… (More)

Is this relevant?

Highly Cited

2004

Highly Cited

2004

- Computer Aided Geometric Design
- 2004

We present an accurate algorithm to compute the internal Voronoi diagram and medial axis of a 3-D polyhedron. It uses exact… (More)

Is this relevant?

Highly Cited

1998

Highly Cited

1998

- The Visual Computer
- 1998

Polyhedron realization is the transformation of a polyhedron into a convex polyhedron with an isomorphic vertex neighborhood… (More)

Is this relevant?

Highly Cited

1995

Highly Cited

1995

- Computer Aided Geometric Design
- 1995

non-geometric setting), we instead just check for consistency. As a DFS in a graph, it requires only O(m) time. If the collection… (More)

Is this relevant?

Highly Cited

1993

Highly Cited

1993

- Math. Program.
- 1993

In a one-machine nonpreemptive scheduling problem, the feasible schedules may be defined by the vector of the corresponding job… (More)

Is this relevant?

Highly Cited

1990

Highly Cited

1990

- Symposium on Computational Geometry
- 1990

We present an algorithm for determining the shortest path between a source point and any destination point along the surface of a… (More)

Is this relevant?

Highly Cited

1975

Highly Cited

1975

- AFIPS National Computer Conference
- 1975

My approach to computer vision is best characterized as inverse computer graphics. In computer graphics, the world is represented… (More)

Is this relevant?

Highly Cited

1973

Highly Cited

1973

- IEEE Trans. Systems, Man, and Cybernetics
- 1973

Texture is one of the important characteristics used in identifying objects or regions of interest in an image, whether the image… (More)

Is this relevant?

Highly Cited

1972

Highly Cited

1972

- 1972

A winged edge Polyhedron remesentatlon ‘ts stated and a set of orimetrves that ~roserv@ Euler's F-E+V = 2 eauatlon are emPined… (More)

Is this relevant?

Highly Cited

1971

Highly Cited

1971

- IJCAI
- 1971

A r e c o g n i t i o n procedure w i t h a range f i n d e r presented i n t h i s paper i s developed f o r the eye of the i n… (More)

Is this relevant?