REVIEW 3 major objections 6 minor 48 references
This paper claims that line density plots can show both dense trends and rare outliers by steering illumination with a per-line outlierness score.
Reviewed by Pith at T0; open to challenge. T0 means a machine referee read the full paper against a public rubric. the ladder, T0–T4 →
T0 review · deepseek-v4-flash
2026-08-03 15:39 UTC pith:CW4JLVEP
load-bearing objection Solid methods paper for line-density shading; the outlierness metric has a real length-bias flaw and the perceptual gains are unproven, but it's worth refereeing. the 3 major comments →
Enhancing Line Density Plots with Outlier Control and Bin-based Illumination
The pith
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
Core claim
The central claim is that the perceived continuity and outlier visibility missing from line density plots can be restored in image space without corrupting the density encoding. The paper introduces a bin-based outlierness measure: each line is scored by how dissimilar its tangent orientations are to those of its neighbors, where similarity is an asymmetric integral of one line's density influence field along another's path. This score lets the method build a 'structural normal map' that layers high-frequency, trajectory-level normals over the usual density-gradient normals, with a prioritized replacement rule so every shaded pixel has a clear origin. Lighting is then made line-aware: per bi
What carries the argument
The load-bearing mechanism is the bin-based outlierness metric (Eq. 3-5): a non-commutative similarity between lines, computed as the normalized sum of one line's CDE influence field sampled along another line's pixels and weighted by directional alignment, then inverted into an average dissimilarity per line. This rank list drives a structural normal map (Eq. 10), which combines a density-gradient low-frequency normal map with a high-frequency map built from user-selected lines via prioritized replacement. Illumination uses per-bin light directions—set perpendicular to a dominant orientation obtained by weighted PCA (high-frequency pixels use the selected line's direction directly)—and appl
Load-bearing premise
The method's practical value rests on the assumption that the bin-based outlierness score ranks lines the way a human analyst would rank them; the paper supports this with the authors' visual inspection rather than a measured user study.
What would settle it
On a synthetic dataset with known ground truth—say, one dense corridor of parallel trajectories plus a few deliberately crossing lines—run the method with OutlierFocus=1, StructureEmphasis high, and check whether exactly the planted crossings are highlighted and the corridor remains unshaded. If the emphasis highlights unrelated geometry or fails to recover the planted outliers, the decoupling claim fails.
If this is right
- An analyst can explore a trajectory dataset with two sliders—OutlierFocus and StructureEmphasis—to shift between flow-following and anomaly-highlighting views without recomputing the density plot.
- Because hue and saturation are never altered, the density-to-color mapping stays interpretable, so the enhanced view can still be read as a density plot.
- The outlierness metric is a standalone artefact: it can rank trajectories by shape congruence for queries like 'most typical path' or 'most anomalous path'.
- The pipeline's linear precomputation and sub-second per-frame updates make interactive exploration feasible for medium-scale datasets (up to about 10,000 lines on modest hardware).
- The luminance-only, direction-adaptive lighting recipe generalizes to other line-data visualizations, including scientific and medical line rendering.
Where Pith is reading between the lines
- Editorial: The paper validates the outlierness ranking only by the authors' visual inspection; a task-based user study would be needed to confirm that the metric's notion of 'outlier' matches human judgment under time pressure.
- Editorial: The per-bin wPCA direction field is unsmoothed; on highly noisy data adjacent bins could get opposite light directions and produce salt-and-pepper flicker—the paper acknowledges this and suggests spatial regularization as future work.
- Editorial: The CIEDE2000 budget gives a natural handle for automatic parameter selection: a system could clamp φ to keep distortion within a chosen tolerance while maximizing structural enhancement, turning the trade-off curve into a controller.
- Editorial: Because the emphasis is relative to the current dataset (ranks normalize to [0,1]), a static image could exaggerate minor deviations in a clean dataset; interactive µ adjustment mitigates this, but static exports might need additional trend-vs-outlier encoding cues.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The paper presents a bin-based illumination method for line density plots. It introduces a bin-based outlierness metric (Eqs. 4–5) that ranks trajectories by local orientation congruence, uses this ranking to construct a structural normal map combining density-gradient normals with high-frequency line normals (Eqs. 7–10), computes per-bin light directions perpendicular to the dominant local orientation, and applies Lambertian shading only to the CIELAB L channel (Eqs. 11–12). The evaluation includes an ablation study, CIEDE2000 color-distortion measurements, runtime scaling, and case studies on vessel, stock, and temperature data.
Significance. The proposed pipeline is a plausible and useful extension of illumination-based density enhancement (e.g., VIDP) from point data to line data, with explicit user controls for balancing trend and outlier emphasis. The paper provides a concrete discretization of CDE, reproducible parameter settings, and quantitative measurements of color distortion and runtime. The CIEDE2000 analysis offers a practical parameter-selection guide. If the outlierness metric is made robust and the perceptual claims are backed by more than qualitative self-assessment, the method could become a valuable tool for trajectory and time-series visualization. The authors are candid about several limitations, which is a strength.
major comments (3)
- [Sec. 3.2, Eq. (4)] The normalization by |P_l'| makes sim(l,l') the average influence over the entire query line, including pixels far outside l's influence field where L_h≈0. Extending a line by a long tail in empty space therefore dilutes sim and inflates outlierness (Eq. 5) without changing local congruence. For example, a line with 100 px of overlap and 900 px of empty tail scores roughly 10× lower sim than the same 100 px overlap without the tail. Because the outlierness ranking drives the µ/σ emphasis (D2/D3), this length sensitivity can make the sliders highlight arbitrary long trajectories instead of meaningful deviations. Please normalize by the number of pixels with non-negligible influence, or otherwise make the measure invariant to irrelevant extension, and test ranking stability.
- [Sec. 4.1 and Sec. 5] The central claim that OutlierFocus/StructureEmphasis 'reveal' meaningful outliers is validated only by the authors' visual inspection (Sec. 4.1 states this explicitly) and Sec. 5 concedes that 'the absence of formal user studies limits claims regarding perceptual effectiveness.' The Chamfer/Hausdorff comparison in the supplementary material does not establish that the ranking matches analyst notions of outliers. I recommend adding a task-based evaluation with labeled outlier trajectories (e.g., the ALN and GLU-PRA cases in Sec. 4.4) or at least a quantitative ranking-quality measure against known ground truth.
- [Sec. 4.3 and Fig. 7] The abstract states 'supports interactive updates for up to 10,000 lines,' but Fig. 7 shows normal-map and lighting each below 1 s, and the text states 'the total update delay can approach 2 seconds.' For interactive exploration, 2 s per slider movement is at the boundary; this claim should be qualified. Additionally, the claimed O(n) outlierness computation is not substantiated: Eq. (4) contains an absolute value, so precomputed vector sums cannot give the exact sum of absolute dot products. Please provide the precise aggregation formula or report the empirical complexity honestly.
minor comments (6)
- [Sec. 3.2, Eq. (3)] The integral in Eq. (3) has a typographical artifact (a stray 'H'). Also, the notation l′ is reused in Eq. (6) for a normalized rank, which conflicts with its use as a line variable in Eqs. (3)–(4); please rename one of them.
- [Sec. 4.2, Fig. 6] The CIEDE2000 curves lack error bars and the Lambertian baseline is shown as a fixed value without specifying its φ or how it was chosen. Since this figure underpins the 'significantly lower color distortion' claim, please report variance across images and the exact baseline configuration.
- [Sec. 3.3] The definition of the spatial footprint B_i as an n×n pixel window is vague; specify how n relates to the discrete kernel size and whether the window is centered on the line pixels.
- [Sec. 3.5, Eq. (12)] The definitions of I_empty and I_min are not fully clear, and the role of negative φ (which the experiments use) deserves a brief explanation.
- [General] The paper repeatedly refers to 'supplementary material' (Secs. 1.1, 1.2, 3.2) but the submitted version does not include it; please ensure it is available to reviewers and readers.
- [Fig. 7] The y-axis label contains a placeholder ampersand: 'Time (ms) for & Normal Map Lighting' should be corrected.
Circularity Check
No significant circularity: the outlierness-based shading pipeline is self-contained; the only by-construction claim is the CIEDE2000 color-fidelity advantage, which the paper itself labels 'by design'.
specific steps
-
other
[Sec. 4.2 (Color Distortions), Fig. 6]
"This significant difference is by design. The baseline’s high distortion (see dashed lines) is a direct consequence of applying Lambertian shading—which acts as a form of brightness scaling—directly in the RGB color space. This single operation non-linearly alters all three dimensions of the perceptual CIELAB space (L, a, and b), causing visible shifts in both hue and luminance. Our method, by contrast, is designed to apply illumination only to the L channel, which results in fundamentally lower color distortion."
The headline claim of lower CIEDE2000 distortion is not an independent empirical prediction: since the method constrains CIELAB a/b channels to remain unchanged while the Lambertian baseline scales all RGB channels, lower ΔE00 follows by construction from the design. The paper explicitly says the difference is 'by design.' This is a consistency check of the design constraint rather than a derived result, and it does not infect the structural normal-map or outlier-emphasis contribution.
full rationale
The core derivation chain—bin-based outlierness (Eqs. 3-5), ranked selection (Eq. 6), structural normal map (Eqs. 7-10), and local lighting (Eq. 11)—is not circular: no parameter is fitted to the output it is said to predict, and no uniqueness theorem or hidden ansatz is imported from the authors' own prior work. The self-citations to Chen et al. [8] for luminance-only shading and Xue et al. [42] for colorization are to published prior components and are not load-bearing for the central claim; the paper also provides its own rationale for the luminance-channel choice. The color-fidelity comparison flagged above is the one place where an evaluation claim reduces to a design constraint, but the paper explicitly acknowledges this. The remaining weaknesses are validation gaps, not circularity: Sec. 4.1 states the ablation comparisons are 'based on qualitative visual assessment by the authors, not on formal perceptual metrics or a controlled user study,' and Sec. 5 concedes 'the absence of formal user studies limits claims regarding perceptual effectiveness.' The outlierness metric's sensitivity to line length (Eq. 4's normalization) is a robustness concern, not a circular reduction. Overall the method is self-contained and mostly honestly evaluated, so a low score is appropriate.
Axiom & Free-Parameter Ledger
free parameters (6)
- OutlierFocus µ =
user-controlled; examples 0.0–1.0 (0.6, 1.0, 0.25)
- StructureEmphasis σ =
user-controlled; examples 0.05, 0.4, 0.5
- Normal scaling η =
3.0 (vessel), 1.0 (stock/temperature)
- Illumination strength φ =
-20 or -25
- CDE kernel size / bandwidth h =
3×3 or 5×5 pixels
- Influence diffusion range =
5 pixels on either side
axioms (7)
- standard math Lampe & Hauser CDE field L_h is a valid continuous influence field for line similarity
- domain assumption Gradient of the density field gives a meaningful low-frequency normal map
- domain assumption Lambertian shading with a 60° elevation angle is perceptually appropriate
- domain assumption Luminance-only shading in CIELAB preserves the density colormap better without harming structural readability
- domain assumption The outlierness score correctly ranks visual distinctiveness of trajectories
- standard math Weighted PCA on local tangent vectors gives a stable dominant orientation
- domain assumption Random subsampling of trajectories preserves the visual structure of the dataset
invented entities (3)
-
Bin-based line outlierness score
no independent evidence
-
Structural normal map n_structure
no independent evidence
-
Per-bin light direction
no independent evidence
read the original abstract
Density plots effectively summarize large numbers of points, which would otherwise lead to severe overplotting in, for example, a scatter plot. However, when applied to line-based datasets, such as trajectories or time series, density plots alone are insufficient, as they disrupt path continuity, obscuring smooth trends and rare anomalies. We propose a bin-based illumination model that decouples structure from density to enhance flow and reveal sparse outliers while preserving the original colormap. We introduce a bin-based outlierness metric to rank trajectories. Guided by this ranking, we construct a structural normal map and apply locally-adaptive lighting in the luminance channel to highlight chosen patterns -- from dominant trends to atypical paths -- with acceptable color distortion. Our interactive method enables analysts to prioritize main trends, focus on outliers, or strike a balance between the two. We demonstrate our method on several real-world datasets, showing it reveals details missed by simpler alternatives, achieves significantly lower CIEDE2000 color distortion than standard shading, and supports interactive updates for up to 10,000 lines.
Figures
Reference graph
Works this paper leans on
-
[1]
https://www.nyse.com/market-data/ historical
New york stock exchange. https://www.nyse.com/market-data/ historical. Accessed: 2025-09-01. 7, 8
2025
-
[2]
http://www.rcc-acis.org/docs_webservices
Acis web services. http://www.rcc-acis.org/docs_webservices. html, 2017. Accessed: 2025-09-01. 8, 9
2017
-
[3]
https://ca.finance.yahoo
Yahoo finance: Glu-pra stock price. https://ca.finance.yahoo. com/quote/GLU-PRA/, 2025. Accessed: 2025-09-01. 9
2025
-
[4]
Akmal Butt and P
M. Akmal Butt and P. Maragos. Optimum design of chamfer distance transforms.IEEE Transactions on Image Processing, 7(10):1477–1484,
-
[5]
G. Arthur Van, F. Staals, M. Löffler, J. Dykes, and B. Speckmann. Multi- granular trend detection for time-series analysis.IEEE Transactions on Visualization and Computer Graphics, 23(1):661–670, 2017. doi: 10. 1109/TVCG.2016.2598619 2
arXiv 2017
-
[6]
H. Bao, X. Chen, K. Lu, C.-W. Fu, J.-D. Fekete, and Y . Wang. Bi-scale density-plot enhancement based on variance-aware filter.Computers & Graphics, 127:104180, 2025. doi: 10.1016/j.cag.2025.104180 2
arXiv 2025
-
[7]
D. B. Carr, R. J. Littlefield, W. L. Nicholson, and J. S. Littlefield. Scat- terplot matrix techniques for large n.Journal of the American Statisti- cal Association, 82(398):424–436, 1987. doi: 10.1080/01621459.1987. 10478445 2
arXiv 1987
-
[8]
X. Chen, Y . Wang, H. Bao, K. Lu, J. Jo, C.-W. Fu, and J.-D. Fekete. Visualization-driven illumination for density plots.IEEE Transactions on Visualization and Computer Graphics, 31(2):1631–1644, 2025. doi: 10. 1109/TVCG.2024.3495695 2, 3, 4, 5
arXiv 2025
-
[9]
S. Eichelbaum, M. Hlawitschka, and G. Scheuermann. Lineao—improved three-dimensional line rendering.IEEE Transactions on Visualization and Computer Graphics, 19(3):433–445, 2013. doi: 10.1109/TVCG.2012.142 9
-
[10]
W. D. Ellis.A Source Book Of Gestalt Psychology (1st ed.). Routledge,
-
[11]
D. Feng, L. Kwock, Y . Lee, and R. Taylor. Matching visual saliency to confidence in plots of uncertain data.IEEE Transactions on Visualization and Computer Graphics, 16(6):980–989, 2010. doi: 10.1109/TVCG.2010. 176 2
-
[12]
A. Frantzis, R. Leaper, P. Alexiadou, A. Prospathopoulos, and D. Lekkas. Hellenic trench ais data. 2018. doi: 10.17882/57040 6, 7, 8
doi:10.17882/57040 2018
-
[13]
A. Frantzis, R. Leaper, P. Alexiadou, A. Prospathopoulos, and D. Lekkas. Shipping routes through core habitat of endangered sperm whales along the hellenic trench, greece: Can we reduce collision risks?PLOS ONE, 14(2):1–21, 2019. doi: 10.1371/journal.pone.0212016 7
-
[14]
H. Hochheiser and B. Shneiderman. Dynamic query tools for time se- ries data sets: Timebox widgets for interactive exploration.Information Visualization, 3(1):1–18, 2004. doi: 10.1057/palgrave.ivs.9500061 3
-
[15]
Hurter, B
C. Hurter, B. Tissoires, and S. Conversy. Fromdady: Spreading aircraft trajectories across views to support iterative queries.IEEE Transactions on Visualization and Computer Graphics, 15(6):1017–1024, 2009. doi: 10 .1109/TVCG.2009.145 2, 3
2009
-
[16]
D. Huttenlocher, G. Klanderman, and W. Rucklidge. Comparing images using the hausdorff distance.IEEE Transactions on Pattern Analysis and Machine Intelligence, 15(9):850–863, 1993. doi: 10.1109/34.232073 4
-
[17]
D. F. Jerding and J. T. Stasko. The information mural: a technique for displaying and navigating large information spaces.IEEE Transactions on Visualization and Computer Graphics, 4(3):257–271, 1998. doi: 10. 1109/2945.722299 2
arXiv 1998
-
[18]
O. D. Lampe and H. Hauser. Curve Density Estimates.Computer Graphics Forum, 30(3):633–642, 2011. doi: 10.1111/j.1467-8659.2011.01912.x 2, 4
arXiv 2011
-
[19]
H. X. Liu, B. Wu, Y . Liu, M. Huang, and Y . F. Xu. A discussion on printing color difference tolerance by ciede2000 color difference formula. InAdvances in Printing and Packaging Technologies (Applied Mechanics and Materials), vol. 262, pp. 96–99. Trans Tech Publications Ltd, 2 2013. doi: 10.4028/www.scientific.net/AMM.262.96 6
-
[20]
M. Mannino and A. Abouzied. Expressive time series querying with hand- drawn scale-free sketches. InProceedings of the 2018 CHI Conference on Human Factors in Computing Systems, CHI ’18, 13 pages, p. 1–13. Association for Computing Machinery, New York, NY , USA, 2018. doi: 10.1145/3173574.3173962 3
arXiv 2018
-
[21]
J. Matejka, F. Anderson, and G. Fitzmaurice. Dynamic opacity optimiza- tion for scatter plots. InProceedings of the 33rd Annual ACM Conference on Human Factors in Computing Systems, CHI ’15, 4 pages, p. 2707–2710. ACM, New York, 2015. doi: 10.1145/2702123.2702585 2
arXiv 2015
-
[22]
A. Mayorga and M. Gleicher. Splatterplots: Overcoming overdraw in scatter plots.IEEE Transactions on Visualization and Computer Graphics, 19(9):1526–1538, 2013. doi: 10.1109/TVCG.2013.65 2, 4
-
[23]
L. Micallef, G. Palmas, A. Oulasvirta, and T. Weinkauf. Towards percep- tual optimization of the visual design of scatterplots.IEEE Transactions on Visualization and Computer Graphics, 23(6):1588–1599, 2017. doi: 10 .1109/TVCG.2017.2674978 2
arXiv 2017
-
[24]
Mokrzycki and M
W. Mokrzycki and M. Tatol. Color difference delta e - a survey.Machine Graphics and Vision, 20:383–411, 04 2011. 6
2011
-
[25]
D. Moritz and D. Fisher. Visualizing a million time series with the density line chart, 2018. doi: 10.48550/arXiv.1808.06019 2
-
[26]
M. Novotny and H. Hauser. Outlier-preserving focus+context visualization in parallel coordinates.IEEE Transactions on Visualization and Computer Graphics, 12(5):893–900, 2006. doi: 10.1109/TVCG.2006.170 2
-
[27]
J. P. O’Shea, M. S. Banks, and M. Agrawala. The assumed light direction for perceiving shape from shading. InProceedings of the 5th Symposium on Applied Perception in Graphics and Visualization, APGV ’08, 8 pages, p. 135–142. Association for Computing Machinery, New York, NY , USA,
-
[28]
B. T. Phong.Illumination for computer generated pictures, p. 95–101. Association for Computing Machinery, New York, NY , USA, 1998. doi: 10.1145/280811.280980 1, 4, 5
arXiv 1998
-
[29]
J. F. Pinto da Costa, H. Alonso, and L. Roque. A weighted principal component analysis and its application to gene expression data.IEEE/ACM Transactions on Computational Biology and Bioinformatics, 8(1):246–252,
-
[30]
Historical stock data for former amer- ican lorain corporation (ticker: Aln)
Planet Green Holdings Corp. Historical stock data for former amer- ican lorain corporation (ticker: Aln). Information accessed through historical financial data providers. Formerly traded as ALN on NYSE American., 2025. The company American Lorain Corporation (for- merly ALN) was renamed to Planet Green Holdings Corp. (ticker: PLAG) in September 2018. The...
2025
-
[31]
D. Pomerenke, F. L. Dennig, D. A. Keim, J. Fuchs, and M. Blumenschein. Slope-dependent rendering of parallel coordinates to reduce density distor- tion and ghost clusters. In2019 IEEE Visualization Conference (VIS), pp. 86–90, 2019. doi: 10.1109/VISUAL.2019.8933706 2
arXiv 2019
-
[32]
S. Rusinkiewicz, M. Burns, and D. DeCarlo. Exaggerated shading for depicting shape and detail. InACM SIGGRAPH 2006 Papers, SIGGRAPH ’06, 7 pages, p. 1199–1205. Association for Computing Machinery, New York, NY , USA, 2006. doi: 10.1145/1179352.1142015 5
arXiv 2006
-
[33]
R. Scheepens, N. Willems, H. van de Wetering, G. Andrienko, N. An- drienko, and J. J. van Wijk. Composite density maps for multivariate trajectories.IEEE Transactions on Visualization and Computer Graphics, 17(12):2518–2527, 2011. doi: 10.1109/TVCG.2011.181 1, 2, 3, 4
-
[34]
R. Scheepens, N. Willems, H. van de Wetering, and J. J. van Wijk. Inter- active visualization of multivariate trajectory data with density maps. In 2011 IEEE Pacific Visualization Symposium, pp. 147–154, 2011. doi: 10. 1109/PACIFICVIS.2011.5742384 1, 2, 4
arXiv 2011
-
[35]
Sharma, W
G. Sharma, W. Wu, and E. N. Dalal. The ciede2000 color-difference formula: Implementation notes, supplementary test data, and mathematical observations.Color Research & Application, 30(1):21–30, 2005. doi: 10. 1002/col.20070 6
2005
-
[36]
B. W. Silverman.Density estimation for statistics and data analysis, vol. 26. CRC press, 1986. 2
1986
-
[37]
M. Thöny and R. Pajarola. Vector map constrained path bundling in 3d environments. InProceedings of the 6th ACM SIGSPATIAL International Workshop on GeoStreaming, IWGS ’15, 10 pages, pp. 33–42. ACM, New York, 2015. doi: 10.1145/2833165.2833168 2
arXiv 2015
-
[38]
T. Trautner, F. Bolte, S. Stoppel, and S. Bruckner. Sunspot Plots: Model- based Structure Enhancement for Dense Scatter Plots.Computer Graphics Forum, 2020. doi: 10.1111/cgf.14001 3
-
[39]
T. Trautner, M. Sbardellati, S. Stoppel, and S. Bruckner. Honeycomb Plots: Visual Enhancements for Hexagonal Maps. InVision, Modeling, and Visualization. The Eurographics Association, 2022. doi: 10.2312/vmv .20221205 3 10 © 2025 IEEE. This is the author’s version of the article that has been published in IEEE Transactions on Visualization and Computer Gra...
work page doi:10.2312/vmv 2022
-
[40]
H. Wickham. Bin-summarise-smooth: a framework for visualising large data.had. co. nz, Tech. Rep, 2013. 2
2013
-
[41]
N. Willems, H. Van De Wetering, and J. J. Van Wijk. Visualization of vessel movements.Computer Graphics Forum, 28(3):959–966, 2009. doi: 10.1111/j.1467-8659.2009.01440.x 1, 2, 3
arXiv 2009
-
[42]
Y . Xue, P. Paetzold, R. Kehlbeck, B. Chen, K. C. Kwan, Y . Wang, and O. Deussen. Reducing ambiguities in line-based density plots by image- space colorization.IEEE Transactions on Visualization and Computer Graphics, 30(1):825–835, 2024. doi: 10.1109/TVCG.2023.3327149 1, 2, 5, 9
arXiv 2024
-
[43]
W. Zeng, Q. Shen, Y . Jiang, and A. Telea. Route-aware edge bundling for visualizing origin-destination trails in urban traffic.Computer Graphics Forum, 38(3):581–593, 2019. doi: 10.1111/cgf.13712 2
-
[44]
Y . Zhao, Y . Wang, J. Zhang, C.-W. Fu, M. Xu, and D. Moritz. Kd-box: Line-segment-based kd-tree for interactive exploration of large-scale time- series data.IEEE Transactions on Visualization and Computer Graphics, 28(1):890–900, 2022. doi: 10.1109/TVCG.2021.3114865 2, 3 11
arXiv 2022
-
[1998]
doi: 10.1109/83.718487 4
-
[2008]
doi: 10.1145/1394281.1394306 4, 5
-
[2009]
doi: 10.1109/TCBB.2009.61 5
-
[2013]
doi: 10.4324/9781315009247 1
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.