• Articles •     Next Articles

A New Representation and Algorithm for Constructing Convex Hulls in Higher Dim ensional Spaces

L Wei; Liang Youdong;   

  1. CAD/CAM Research Center Zhejiang University; Hanzhou; CAD/CAM Research Center; Zhejiang University;
  • Online:1992-01-10 Published:1992-01-10

This paper presents a new and simple scheme to describe the convex hull in R~d,which only uses three kinds of the faces of the convex hull,i.e.,the d-1-faces,d-2-faces and 0-faces.Thus,we develop an efficient new algorithm for constructing the convex hull of a finite set of points incrementally. This algorithm employs much less storage and time than that of the previously-existing approaches.The analysis of the running time as well as the storage for the new algorithm is also theoretically made.The algorith…

Key words: speech detection,1/f process,wavelet,robust speech recognition;

[1] F.A.Preparata and M.I.Shamos. Computational Geometry:An Introduction. Springer-Verlag, 1985.

[2] H.Edelsbrunner, Algorithms in Combinational Geometry. Springer-Verlag, 1987.

[3] A.M.Day, Planar convex hull algorithms in theorey and practice. Conput. Graph. Forum, 1988,7,177-193.

[4] K.Q.Brown, Geometric Transformations for Fast Geometric Algorithms. Ph.D Thesis, Carmegie Mellon Univ., 1979.

[5] D.Avis and B.K.Bhattacharya, Algorithm for Computing d-dimensional Voronoi Diagrams and Their Duals. In Conputationai Geometry, F.A.Preparata ed., JAT Press. INC. 1984. 159-180. ……….
No related articles found!
Full text



No Suggested Reading articles found!

ISSN 1000-9000(Print)

CN 11-2296/TP

Editorial Board
Author Guidelines
Journal of Computer Science and Technology
Institute of Computing Technology, Chinese Academy of Sciences
P.O. Box 2704, Beijing 100190 P.R. China
E-mail: jcst@ict.ac.cn
  Copyright ©2015 JCST, All Rights Reserved