Discrete and Computational Geometry Japanese Conference, JCDCG 2004, Tokyo, Japan, October 8-11, 2004, Revised Selected Papers /

Λεπτομέρειες βιβλιογραφικής εγγραφής
Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
Άλλοι συγγραφείς: Akiyama, Jin (Επιμελητής έκδοσης), Kano, Mikio (Επιμελητής έκδοσης), Tan, Xuehou (Επιμελητής έκδοσης)
Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
Γλώσσα:English
Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg, 2005.
Σειρά:Lecture Notes in Computer Science, 3742
Θέματα:
Διαθέσιμο Online:Full Text via HEAL-Link
LEADER 03132nam a22005655i 4500
001 978-3-540-32089-0
003 DE-He213
005 20151204153017.0
007 cr nn 008mamaa
008 100320s2005 gw | s |||| 0|eng d
020 |a 9783540320890  |9 978-3-540-32089-0 
024 7 |a 10.1007/11589440  |2 doi 
040 |d GrThAP 
050 4 |a T385 
072 7 |a UML  |2 bicssc 
072 7 |a COM012000  |2 bisacsh 
082 0 4 |a 006.6  |2 23 
245 1 0 |a Discrete and Computational Geometry  |h [electronic resource] :  |b Japanese Conference, JCDCG 2004, Tokyo, Japan, October 8-11, 2004, Revised Selected Papers /  |c edited by Jin Akiyama, Mikio Kano, Xuehou Tan. 
264 1 |a Berlin, Heidelberg :  |b Springer Berlin Heidelberg,  |c 2005. 
300 |a VIII, 213 p.  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
490 1 |a Lecture Notes in Computer Science,  |x 0302-9743 ;  |v 3742 
505 0 |a Matching Points with Circles and Squares -- The Minimum Manhattan Network Problem: A Fast Factor-3 Approximation -- Algorithms for the d-Dimensional Rigidity Matroid of Sparse Graphs -- Sliding Disks in the Plane -- Weighted Ham-Sandwich Cuts -- Towards Faster Linear-Sized Nets for Axis-Aligned Boxes in the Plane -- Farthest-Point Queries with Geometric and Combinatorial Constraints -- Grid Vertex-Unfolding Orthostacks -- A Fixed Parameter Algorithm for the Minimum Number Convex Partition Problem -- Tight Time Bounds for the Minimum Local Convex Partition Problem -- I/O-Efficiently Pruning Dense Spanners -- On the Minimum Size of a Point Set Containing Two Non-intersecting Empty Convex Polygons -- Three Equivalent Partial Orders on Graphs with Real Edge-Weights Drawn on a Convex Polygon -- Wedges in Euclidean Arrangements -- Visual Pascal Configuration and Quartic Surface -- Nonexistence of 2-Reptile Simplices -- Single-Vertex Origami and Spherical Expansive Motions -- An Optimal Algorithm for the 1-Searchability of Polygonal Rooms -- Crossing Stars in Topological Graphs -- The Geometry of Musical Rhythm. 
650 0 |a Computer science. 
650 0 |a Data structures (Computer science). 
650 0 |a Algorithms. 
650 0 |a Computer science  |x Mathematics. 
650 0 |a Computer graphics. 
650 0 |a Convex geometry. 
650 0 |a Discrete geometry. 
650 1 4 |a Computer Science. 
650 2 4 |a Computer Graphics. 
650 2 4 |a Discrete Mathematics in Computer Science. 
650 2 4 |a Algorithm Analysis and Problem Complexity. 
650 2 4 |a Data Structures. 
650 2 4 |a Convex and Discrete Geometry. 
700 1 |a Akiyama, Jin.  |e editor. 
700 1 |a Kano, Mikio.  |e editor. 
700 1 |a Tan, Xuehou.  |e editor. 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer eBooks 
776 0 8 |i Printed edition:  |z 9783540304678 
830 0 |a Lecture Notes in Computer Science,  |x 0302-9743 ;  |v 3742 
856 4 0 |u http://dx.doi.org/10.1007/11589440  |z Full Text via HEAL-Link 
912 |a ZDB-2-SCS 
912 |a ZDB-2-LNC 
950 |a Computer Science (Springer-11645)