Publication

Combinatorial face enumeration in convex polytopes

1994
Journal paper
Abstract

Let P be a d-dimensional convex polytope with n facets F1,F2,....,Fn. The (combinatorial) representation of a face F of P is the set of facet indices j such that F c Fj. Given the representations of all vertices of P, the combinatorial face enumeration problem is to enumerate all faces in terms of their representations. In this paper que propose two algorithms for the combinatorial face enumeration problem. the first algorithm enumerates all faces in time O(f^2d minm.n), where f and m denotes the number of faces and vertices, respectively. For the case of simple polytopes, the second algorithm solves the problem in O(fd) time, provided that a good orientation of the graph of polytope is also given as input.

About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.