State of the Journal
Pages 1440 - 1441
Abstract
Presents an editorial which examines the current state of the journal and planned future directions for the publication.
References
[1]
H. Carr, J. Snoeyink, and U. Axen, “Computing contour trees in all dimensions,” Comput. Geometry, vol. 24, no. 2, pp. 75–94, 2003.
[2]
H. Saikia and T. Weinkauf, “Global feature tracking and similarity estimation in time-dependent scalar fields,” Comput. Graph. Forum, vol. 36, no. 3, 2017, pp. 1–11.
[3]
M. Hilaga, Y. Shinagawa, T. Kohmura, and T. L. Kunii, “Topology matching for fully automatic similarity estimation of 3d shapes,” in Proc. 28th Annu. Conf. Comput. Graph. Interactive Tech., 2001, pp. 203–212.
[4]
D. M. Thomas and V. Natarajan, “Symmetry in scalar field topology,” IEEE Trans. Vis. Comput. Graph., vol. 17, no. 12, pp. 2035–2044, 2011.
[5]
D. M. Thomas and V. Natarajan, “Detecting symmetry in scalar fields using augmented extremum graphs,” IEEE Trans. Vis. Comput. Graph., vol. 19, no. 12, pp. 2663–2672, Dec. 2013.
[6]
T. B. Masood, D. M. Thomas, and V. Natarajan, “Scalar field visualization via extraction of symmetric structures,” Visual Comput., vol. 29, no. 6–8, pp. 761–771, 2013.
[7]
H. Saikia, H. P. Seidel, and T. Weinkauf, “Extended branch decomposition graphs: Structural comparison of scalar data,” Comput. Graph. Forum, vol. 33, no. 3, pp. 41–50, 2014.
[8]
D. M. Thomas and V. Natarajan, “Multiscale symmetry detection in scalar fields by clustering contours,” IEEE Trans. Vis. Comput. Graph., vol. 20, no. 12, pp. 2427–2436, Dec. 2014.
[9]
P. Oesterling, C. Heine, G. H. Weber, D. Morozov, and G. Scheuermann, “Computing and visualizing time-varying merge trees for high-dimensional data,” in TopoinVis IV. New York, NY, USA: Springer, 2017, pp. 87–101.
[10]
N. Sauber, H. Theisel, and H.-P. Seidel, “Multifield-graphs: An approach to visualizing correlations in multifield scalar data,” IEEE Trans. Vis. Comput. Graph., vol. 12, no. 5, pp. 917–924, Sep./Oct. 2006.
[11]
S. Nagaraj, V. Natarajan, and R. S. Nanjundiah, “A gradient-based comparison measure for visual analysis of multifield data,” Comput. Graph. Forum, vol. 30, no. 3, 2011, pp. 1101–1110.
[12]
I. Demir, C. Dick, and R. Westermann, “Multi-charts for comparative 3d ensemble visualization,” IEEE Trans. Vis. Comput. Graph., vol. 20, no. 12, pp. 2694–2703, Dec. 2014.
[13]
S. Dutta, J. Woodring, H.-W. Shen, J.-P. Chen, and J. Ahrens, “Homogeneity guided probabilistic data summaries for analysis and visualization of large-scale data sets,” in Proc. PacificVis, 2017, pp. 111–120.
[14]
D. Cohen-Steiner, H. Edelsbrunner, and J. Harer, “Stability of persistence diagrams,” Disc. Comput. Geom., vol. 37, no. 1, pp. 103–120, 2007.
[15]
D. Morozov, K. Beketayev, and G. Weber, “Interleaving distance between merge trees,” Discrete Comput. Geom., vol. 49, no. 52, pp. 22–45, 2013.
[16]
K. Beketayev, D. Yeliussizov, D. Morozov, G. H. Weber, and B. Hamann, “Measuring the distance between merge trees,” in TopoinVis III. New York, NY, USA: Springer, 2014, pp. 151–165.
[17]
G. Reeb, “Sur les points singuliers d'une forme de Pfaff completement intégrable ou d'une fonction numérique,” CR Acad. Sci. Paris, vol. 222, no. 847–849, 1946, Art. no.
[18]
U. Bauer, X. Ge, and Y. Wang, “Measuring distance between Reeb graphs,” in Proc. 13th Symp. Comput. Geom., 2014, pp. 464–474.
[19]
P. K. Agarwal, K. Fox, A. Nath, A. Sidiropoulos, and Y. Wang, “Computing the Gromov-Hausdorff distance for metric trees,” in Proc. Int. Symp. Alg. Comput., 2015, pp. 529–540.
[20]
B. Di Fabio and C. Landi, “The edit distance for Reeb graphs of surfaces,” Disc. Comput. Geom., vol. 55, no. 2, pp. 423–461, 2016.
[21]
T. Dey, D. Shi, and Y. Wang, “Comparing Graphs via Persistence Distortion,” Proc. 31rd Annu. Symp. Comput. Geom., pp. 491–506, 2015.
[22]
V. Narayanan, D. M. Thomas, and V. Natarajan, “Distance between extremum graphs,” in Proc. PacificVis, 2015, pp. 263–270.
[23]
H. Saikia, H.-P. Seidel, and T. Weinkauf, “Fast similarity search in scalar fields using merging histograms,” in Proc. TopoInVis, 2015, pp. 1–14.
[24]
T. A. Gillette, P. Hosseini, and G. A. Ascoli, “Topological characterization of neuronal arbor morphology via sequence representation: II - global alignment,” BMC Bioinf., vol. 16, no. 1, pp. 209–226, 2015.
[25]
P. Klein, S. Tirthapura, D. Sharvit, and B. Kimia, “A tree-edit-distance algorithm for comparing simple, closed shapes,” in Proc. 11th Annu. ACM-SIAM Symp. Discr. Algorithms, 2000, pp. 696–704.
[26]
M. McVicar, B. Sach, C. Mesnage, J. Lijffijt, E. Spyropoulou, and T. De Bie, “SuMoTED: An intuitive edit distance between rooted unordered uniquely-labelled trees,” Pattern Recognit. Lett., vol. 79, pp. 52–59, 2016.
[27]
D. Fukagawa, T. Tamura, A. Takasu, E. Tomita, and T. Akutsu, “A clique-based method for the edit distance between unordered trees and its application to analysis of glycan structures,” BMC Bioinf., vol. 12, no. Suppl 1, 2011, Art. no.
[28]
S. Schirmer and R. Giegerich, “Forest alignment with affine gaps and anchors, applied in RNA structure comparison,” Theoretical Comput. Sci., vol. 483, pp. 51–67, 2013.
[29]
P. Ferraro and C. Godin, “A distance measure between plant architectures,” Ann. Forest Sci., vol. 57, no. 5, pp. 445–461, 2000.
[30]
K. Zhang and D. Shasha, “Simple fast algorithms for the editing distance between trees and related problems,” SIAM J. Comput., vol. 18, no. 6, pp. 1245–1262, 1989.
[31]
K. Zhang, “Algorithms for the constrained editing distance between ordered labeled trees and related problems,” Pattern Recognit., vol. 28, no. 3, pp. 463–474, 1995.
[32]
K. Zhang, R. Statman, and D. Shasha, “On the editing distance between unordered labeled trees,” Inf. Process. Lett., vol. 42, no. 3, pp. 133–139, 1992.
[33]
K. Zhang, “A constrained edit distance between unordered labeled trees,” Algorithmica, vol. 15, pp. 205–222, 1996.
[34]
H. Touzet, “Tree edit distance with gaps,” Inf. Process. Lett., vol. 85, no. 3, pp. 123–129, 2003.
[35]
H. Xu, “An algorithm for comparing similarity between two trees,” CoRR, vol. abs/1508.03381, pp. 1–58, 2015.
[36]
B. Rieck, H. Leitte, and F. Sadlo, “Hierarchies and ranks for persistence pairs,” in Proc. TopoInVis, pp. 1–14, 2017.
[37]
R. Sridharamurthy, A. Kamakshidasan, and V. Natarajan, “Edit distances for comparing merge trees,” in Proc. IEEE SciVis Posters, 2017.
[38]
H. Edelsbrunner, D. Letscher, and A. Zomorodian, “Topological persistence and simplification,” in Proc. Found. Comput. Sci., 2000, pp. 454–463.
[39]
D. Morozov and G. Weber, “Distributed merge trees,” in Proc. ACM SIGPLAN Symp. Principles Practice Parallel Program., 2013, pp. 93–102.
[40]
A. Acharya and V. Natarajan, “A parallel and memory efficient algorithm for constructing the contour tree,” in Proc. PacificVis, 2015, pp. 271–278.
[41]
P. Bille, “A survey on tree edit distance and related problems,” Theoretical Comput. Sci., vol. 337, no. 1–3, pp. 217–239, 2005.
[42]
T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to Algorithms, 3rd ed. Cambridge, MA, USA: MIT Press, 2009.
[43]
M. Levandowsky and D. Winter, “Distance between sets,” Nature, vol. 234, no. 5323, 1971, Art. no.
[44]
C. Villani, Optimal Transport: Old and New. New York, NY, USA: Springer, 2000.
[45]
H. W. Kuhn, “The hungarian method for the assignment problem,” Naval Res. Logistics, vol. 2, no. 1/2, pp. 83–97, 1955.
[46]
H. Doraiswamy and V. Natarajan, “Computing Reeb graphs as a union of contour trees,” IEEE Trans. Vis. Comput. Graphics, vol. 19, no. 2, pp. 249–262, Feb. 2013.
[47]
J. Ahrens, B. Geveci, C. Law, C. Hansen, and C. Johnson, “Paraview: An end-user tool for large-data visualization,” Vis. Handbook, pp. 717–731, 2005.
[48]
J. Tierny, G. Favelier, J. A. Levine, C. Gueunet, and M. Michaux, “The topology ToolKit,” IEEE Trans. Vis. Comput. Graph., vol. 24, no. 1, pp. 832–842, Jan. 2018. [Online]. Available: https://topology-tool-kit.github.io/
[49]
T. Weinkauf and H. Theisel, “Streak lines as tangent curves of a derived vector field,” IEEE Trans. Vis. Comput. Graph., vol. 16, no. 6, pp. 1225–1234, Dec. 2010.
[50]
W. von Funck, T. Weinkauf, H. Theisel, and H.-P. Seidel, “Smoke surfaces: An interactive flow visualization technique inspired by real-world flow experiments,” IEEE Trans. Vis. Comput. Graph., vol. 14, no. 6, pp. 1396–1403, Dec. 2008.
Index Terms
- State of the Journal
Index terms have been assigned to the content through auto-classification.
Recommendations
Journal self-citation study for semiconductor literature: synchronous and diachronous approach
Special issue: InformetricsThe present study investigates the self-citations of the most productive semiconductor journals by synchronous (self-citing rate) and diachronous (self-cited rate) approaches. Journal's productivity of 100 most productive semiconductor journals was ...
Generating finite state machines from abstract state machines
ISSTA '02: Proceedings of the 2002 ACM SIGSOFT international symposium on Software testing and analysisWe give an algorithm that derives a finite state machine (FSM) from a given abstract state machine (ASM) specification. This allows us to integrate ASM specs with the existing tools for test case generation from FSMs. ASM specs are executable but have ...
Half-Hot State Assignments for Finite State Machines
The state assignment problem for the programmable logic array (PLA) implementation of finite state machines is considered. It is pointed out that the number of PLA columns can be reduced by using state assignments leading to logic that is unate in the ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
1077-2626 © 2019 IEEE Personal use is permitted, but republication/redistribution requires IEEE permission. See http://www.ieee.org/publications_standards/publications/rights/index.html for more information.
Publisher
IEEE Educational Activities Department
United States
Publication History
Published: 01 March 2020
Qualifiers
- Opinion
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 29 Nov 2024
Other Metrics
Citations
View Options
View options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in