Discrete and computational geometry

Discrete and computational geometry

by JCDCG 2000 (2000 Tokyo

Book 2098 of Lecture notes in computer science --

2001

Browse books you can read free on Readfeed

No club is reading this yet — be the first to start one

Start a club free
About
TheJapanConferenceonDiscreteandComputationalGeometry(JCDCG)has beenheldannuallysince1997. Oneofthegoalsofthisconferenceseriesistobring togetherJapaneseresearchersfrombothacademiaandindustrywithresearchers inthese?eldsfromabroadtosharetheirrecentresults. JCDCG2000washeld22–25November2000atTokaiUniversityinTokyo inconjunctionwiththecelebrationofWorldMathematicsYear2000. Atotalof 120participantsfrom20countriesattended. Thisvolumeconsistsofthepapers presentedatJCDCG2000,whichhavebeenrefereedandrevised. Somepapers whichappearinshortforminthisvolumealsoappearinfullerexpandedversions injournalsdedicatedtocomputationalgeometry. Theorganizersoftheconferencethanktheprincipalspeakersfortheir- terestandsupport:ImreBarany,ErikD. Demaine,GregN. Fredrickson,Gyula Karolyi,NaokiKatoh,DavidKirkpatrick,JosephO’Rourke,JanosPach,Jozsef Solymosi,WilliamSteiger,JorgeUrrutia,andAllanWilks.^ Theythankthe- jorsponsorsfortheirgenerouscontribution:TheResearchInstituteofEdu- tionalDevelopmentofTokaiUniversity,theMinistryofEducationofJapan(for thegrant-in-aidtoA. Saito(A):10304008),andTokaiEducationInstruments Co. ,Ltd. April2001 TheEditors, JinAkiyama MikioKano MasatsuguUrabe OrganizingCommittee Chairs:JinAkiyamaandMikioKano Members: TetsuoAsano,DavidAvis,VasekChvatal,KiyoshiHosono,HiroshiImai, TakakoKodate,JosephO’Rourke,ToshinoriSakai,XuehouTan,Morimasa Tsuchiya,MasatsuguUrabe,andJorgeUrrutia. TableofContents Papers DudeneyDissectionsofPolygonsandPolyhedrons-ASurvey-. . . . . . . . . . 1 J. AkiyamaandG. Nakamura UniversalMeasuringDeviceswithoutGradations. . . . . . . . . . . . . . . . . . . . . . . 31 J. Akiyama, H. Fukuda,G. Nakamura, T. Sakai, J. Urrutia, andC. Zamora-Cura ANoteonthePurelyRecursiveDissectionforaSequentially n-Divisible Square . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 41 J.^ Akiyama, G. Nakamura, A. Nozaki, and K. Ozawa SequentiallyDivisibleDissectionsofSimplePolygons . . . . . . . . . . . . . . . . . . 53 J. Akiyama, T. Sakai, andJ. Urrutia PackingConvexPolygonsintoRectangulerBoxes . . . . . . . . . . . . . . . . . . . . . 67 H. AltandF. Hurtado OntheNumberofViewsofPolyhedralScenes . . . . . . . . . . . . . . . . . . . . . . . . 81 B. Aronov, H. Br¨ onnimann,D. Halperin,andR. Schi?enbauer ProblemsandResultsAroundtheErdos-Szek ? eresConvex PolygonTheorem . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 91 I. Bar ´ an ´ y andG. Kar ´ olyi OnFindingMaximum-CardinalitySymmetricSubsets . . . . . . . . . . . . . . . . . 106 P. Brass FoldingandUnfoldingLinkages,Paper,andPolyhedra . . . . . . . . . . . . . . . . . 113 E. D. Demaine OntheSkeletonoftheMetricPolytope . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 125 A. Deza,K. Fukuda,D. Pasechnik, andM. Sato GeometricDissectionsThatSwingandTwist . .^ . . . . . . . . . . . . . . . . . . . . . . . 137 G. N. Frederickson OnConvexDecompositionsofPoints . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 149 K. Hosono, D. Rappaport, andM. Urabe VolumeQueriesinPolyhedra . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 156 J. IaconoandS. Langerman VIII Table ofContents SumofEdgeLengthsofaGraphDrawnonaConvexPolygon . . . . . . . . . . 160 H. Ito,H. Uehara, andM. Yokoyama OnDoubleBoundGraphswithRespecttoGraphOperations . . . . . . . . . . . 167 S. Iwai,K. Ogawa,andM. Tsuchiya GeneralizedBalancedPartitionsofTwoSetsofPointsinthePlane . . . . . . 176 A. KanekoandM. Kano OnPathsinaCompleteBipartiteGeometricGraph . . . . . . . . . . . . . . . . . . . 187 A. KanekoandM. Kano ApproximatingUniformTriangularMeshesforSpheres . . . . . . . . . . . . . . . . . 192 N. Katoh,H. Kojima, andR. Taniguchi TheConstructionofDelaunayDiagramsbyLobReduction . . . . . . . . . . . . . 205 P. Kau?mannand J. C.^ Spehner GeometricTransformationsinPlaneTriangulations . . . . . . . . . . . . . . . . . . . . 217 K. Kawarabayashi, A. Nakamoto, Y. Oda, andM. Watanabe SeparationSensitiveKineticSeparationStructuresforConvexPolygons . . 222 D. Kirkpatrick andB. Speckmann OnAcuteTriangulationsofQuadrilaterals . . . . . . . . . . . . . . . . . . . . . . . . . . . . 237 H. Maehara IntersectingRedandBlueLineSegmentsinOptimalTimeandPrecision . 244 A. MantlerandJ. Snoeyink TightErrorBoundsofGeometricProblemsonConvexObjectswith ImpreciseCoordinates . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 252 T. NagaiandN. Tokura TriangleContactSystems,OrthogonalPlanePartitionsandtheirHitGraphs 264 A. Nakamoto NoteonDiagonalFlipsandChromaticNumbersofQuadrangulationson ClosedSurfaces . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 274 A. NakamotoandS. Negami AnExtensionofCauchy’sArmLemmawithApplicationtoCurve Development .^ . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 280 J. O’Rourke OntheComplexityoftheUnionofGeometricObjects . . . . . . . . . . . . . . . . . 292 J. Pach Table of Contents IX StructureTheoremsforSystemsofSegments . . . . . . . . . . . . . . . . . . . . . . . . . 308 J. Pach andJ. Solymosi 3-dimensionalSingleActiveLayerRouting . . . . . . . . . . . . . . . . . . . . . . . . . . .

Discuss Discrete and computational geometry with other readers

Join or start a book club for Discrete and computational geometry on Readfeed. Live chat, shared reading progress, and AI discussion questions — free to get started.

Frequently asked questions

How do I join a book club for Discrete and computational geometry?

Sign up free on Readfeed, then browse public clubs or start your own club with Discrete and computational geometry as the current read. Invite friends with a share link and discuss together with live chat and AI discussion questions.

Can I discuss Discrete and computational geometry with other readers online?

Yes. Readfeed book clubs let you chat live, share progress, and join discussions about Discrete and computational geometry with readers worldwide — whether your club is virtual, in-person, or hybrid.

Is Readfeed free?

Yes. Creating an account and joining book clubs is free. Sign up to find readers who love the same books and start discussing today.