| Discipline | Computer Science Mathematics |
|---|---|
| Language | English |
| Edited by | |
| Publication details | |
| Publisher | |
| 0.082 | |
| Standard abbreviations | |
| Int. J. Comput. Geom. Appl. | |
| Indexing | |
| ISSN | 0218-1959 (print) 1793-6357 (web) |
| Links | |
The International Journal of Computational Geometry and Applications (IJCGA) is a bimonthly journal published since 1991, by World Scientific. It covers the application of computational geometry in design and analysis of algorithms, focusing on problems arising in various fields of science and engineering such as computer-aided geometry design (CAGD), operations research, and others.
World Scientific Publishing is an academic publisher of scientific, technical, and medical books and journals headquartered in Singapore. The company was founded in 1981. It publishes about 600 books annually as well as 135 journals in various fields. In 1995, World Scientific co-founded the London-based Imperial College Press together with the Imperial College of Science, Technology and Medicine.
Computational geometry is a branch of computer science devoted to the study of algorithms which can be stated in terms of geometry. Some purely geometrical problems arise out of the study of computational geometric algorithms, and such problems are also considered to be part of computational geometry. While modern computational geometry is a recent development, it is one of the oldest fields of computing with history stretching back to antiquity.
In computer science, the analysis of algorithms is the determination of the computational complexity of algorithms, that is the amount of time, storage and/or other resources necessary to execute them. Usually, this involves determining a function that relates the length of an algorithm's input to the number of steps it takes or the number of storage locations it uses. An algorithm is said to be efficient when this function's values are small, or grow slowly compared to a growth in the size of the input. Different inputs of the same length may cause the algorithm to have different behavior, so best, worst and average case descriptions might all be of practical interest. When not otherwise specified, the function describing the performance of an algorithm is usually an upper bound, determined from the worst case inputs to the algorithm.
Contents
The current editors-in-chief are D.-T. Lee of the Institute of Information Science in Taiwan, and Joseph S. B. Mitchell from the Department of Applied Mathematics and Statistics in the State University of New York at Stony Brook.
Der-Tsai Lee is a computer scientist, known for his work in computational geometry. For many years he was a professor at Northwestern University. He has been a distinguished research fellow of the Institute for Information Science at the Academia Sinica in Taipei, Taiwan since 1998. From 1998 to 2008, he was director of this institute. He was the 14th President of National Chung Hsing University from August 1, 2011.
Joseph S. B. Mitchell is an American computer scientist and mathematician. He is Professor of Applied Mathematics and Statistics and Research Professor of Computer Science at Stony Brook University.
The State University of New York is a system of public institutions of higher education in New York, United States. It is the largest comprehensive system of universities, colleges, and community colleges in the United States, with a total enrollment of 424,051 students, plus 2,195,082 adult education students, spanning 64 campuses across the state. Led by Chancellor Kristina M. Johnson, the SUNY system has 91,182 employees, including 32,496 faculty members, and some 7,660 degree and certificate programs overall and a $10.7 billion budget.
