International Journal of Computational Geometry & Applications
نویسندگان
چکیده
Deciding 3-colorability for general plane graphs is known to be an NP-complete problem. 31 However, for certain families of graphs, like triangulations, polynomial time algorithms 32 exist. We consider the family of pseudo-triangulations, which are a generalization of 33 triangulations, and prove NP-completeness for this class. This result also holds if we 34 bound their face degree to four, or exclusively consider pointed pseudo-triangulations 35 with maximum face degree five. In contrast to these completeness results, we show that 36 pointed pseudo-triangulations with maximum face degree four are always 3-colorable. 37
منابع مشابه
Parleda: a Library for Parallel Processing in Computational Geometry Applications
ParLeda is a software library that provides the basic primitives needed for parallel implementation of computational geometry applications. It can also be used in implementing a parallel application that uses geometric data structures. The parallel model that we use is based on a new heterogeneous parallel model named HBSP, which is based on BSP and is introduced here. ParLeda uses two main lib...
متن کاملInternational Journal of Computational Geometry & Applications C World Scientiic Publishing Company an Algorithm for Drawing a Hierarchical Graph
متن کامل
Near Pole Polar Diagram of Points and its Duality with Applications
In this paper we propose a new approach to plane partitioning with similar features to those of Polar Diagram, but we assume that the pole is close to the sites. The result is a new tessellation of the plane in regions called Near Pole Polar Diagram NPPD. Here we define the (NPPD) of points, the dual and the Contracted dual of it, present an optimal algorithms to draw them and discuss the appli...
متن کاملInternational Journal of Computational Geometry & Applications C World Scientific Publishing Company
We prove a general lemma on the existence of (1/r)-cuttings of geometric objects in Ed that satisfy certain properties. We use this lemma to construct (1/r)-cuttings of small size for arrangements of line segments in the plane and arrangements of triangles in 3-space; for line segments in the plane we obtain a cutting of size O(r+Ar2/n2), and for triangles in 3-space our cutting has size O(r2+ε...
متن کاملInvestigation of handmade ferrofluids' motion in a ventilated cavity using computational fluid dynamics
In this research, some more applicable ferrofluids are produced and their mechanical specifications are measured, experimentally. Also, their treatments in the ventilated cavity geometry are assessed numerically. The magnetite nanoparticles are produced by a chemical combination of Fe2+ and Fe3+ with NH3. In order to solve the nanoparticles in the new mediums, a...
متن کامل